./Ultimate.py --spec /mnt/goblint-svcomp/goblint-bench/bench/concrat/properties/no-data-race.prp --file /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for data races
Using default analysis
Version 0e0057cc
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data -tc /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/AutomizerReach.xml -i /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i -s /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) )

 --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60df072d699565205c7a50ee01ebb33840af7da28c1217f0c0367bae5cd851bd
--- Real Ultimate output ---
This is Ultimate 0.2.4-dev-0e0057c
[2024-02-28 20:26:44,400 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2024-02-28 20:26:44,442 INFO  L114        SettingsManager]: Loading settings from /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf
[2024-02-28 20:26:44,446 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2024-02-28 20:26:44,446 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-02-28 20:26:44,464 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2024-02-28 20:26:44,464 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-02-28 20:26:44,465 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-02-28 20:26:44,465 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-02-28 20:26:44,466 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-02-28 20:26:44,466 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-02-28 20:26:44,467 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2024-02-28 20:26:44,467 INFO  L153        SettingsManager]:  * Use SBE=true
[2024-02-28 20:26:44,467 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-02-28 20:26:44,467 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2024-02-28 20:26:44,468 INFO  L153        SettingsManager]:  * sizeof long=4
[2024-02-28 20:26:44,468 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2024-02-28 20:26:44,468 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2024-02-28 20:26:44,469 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2024-02-28 20:26:44,469 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2024-02-28 20:26:44,469 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-02-28 20:26:44,469 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2024-02-28 20:26:44,470 INFO  L153        SettingsManager]:  * Check absence of data races in concurrent programs=true
[2024-02-28 20:26:44,470 INFO  L153        SettingsManager]:  * Check unreachability of reach_error function=false
[2024-02-28 20:26:44,470 INFO  L153        SettingsManager]:  * sizeof long double=12
[2024-02-28 20:26:44,471 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2024-02-28 20:26:44,471 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2024-02-28 20:26:44,471 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-02-28 20:26:44,471 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2024-02-28 20:26:44,472 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2024-02-28 20:26:44,472 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:26:44,472 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-02-28 20:26:44,472 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2024-02-28 20:26:44,473 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2024-02-28 20:26:44,473 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2024-02-28 20:26:44,473 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-02-28 20:26:44,473 INFO  L153        SettingsManager]:  * Apply one-shot large block encoding in concurrent analysis=false
[2024-02-28 20:26:44,473 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2024-02-28 20:26:44,474 INFO  L153        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2024-02-28 20:26:44,474 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2024-02-28 20:26:44,474 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2024-02-28 20:26:44,474 INFO  L153        SettingsManager]:  * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) )


Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60df072d699565205c7a50ee01ebb33840af7da28c1217f0c0367bae5cd851bd
[2024-02-28 20:26:44,638 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2024-02-28 20:26:44,666 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-02-28 20:26:44,668 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-02-28 20:26:44,669 INFO  L270        PluginConnector]: Initializing CDTParser...
[2024-02-28 20:26:44,669 INFO  L274        PluginConnector]: CDTParser initialized
[2024-02-28 20:26:44,670 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-02-28 20:26:45,748 INFO  L533              CDTParser]: Created temporary CDT project at NULL
[2024-02-28 20:26:45,929 INFO  L384              CDTParser]: Found 1 translation units.
[2024-02-28 20:26:45,930 INFO  L180              CDTParser]: Scanning /mnt/goblint-svcomp/goblint-bench/bench/concrat/race-challenges/per-thread-index-bitmask.i
[2024-02-28 20:26:45,941 INFO  L427              CDTParser]: About to delete temporary CDT project at /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8f995217f/1ad858bd3c3c486aae9ab2831b3add6e/FLAG6aade432c
[2024-02-28 20:26:46,305 INFO  L435              CDTParser]: Successfully deleted /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/data/8f995217f/1ad858bd3c3c486aae9ab2831b3add6e
[2024-02-28 20:26:46,307 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-02-28 20:26:46,308 INFO  L133        ToolchainWalker]: Walking toolchain with 6 elements.
[2024-02-28 20:26:46,309 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-02-28 20:26:46,309 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-02-28 20:26:46,313 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2024-02-28 20:26:46,313 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,314 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a4e51c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46, skipping insertion in model container
[2024-02-28 20:26:46,314 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,357 INFO  L177         MainTranslator]: Built tables and reachable declarations
[2024-02-28 20:26:46,630 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:26:46,640 INFO  L202         MainTranslator]: Completed pre-run
[2024-02-28 20:26:46,676 INFO  L209          PostProcessor]: Analyzing one entry point: main
[2024-02-28 20:26:46,733 WARN  L675               CHandler]: The function ffs is called, but not defined or handled by StandardFunctionHandler.
[2024-02-28 20:26:46,739 INFO  L206         MainTranslator]: Completed translation
[2024-02-28 20:26:46,740 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46 WrapperNode
[2024-02-28 20:26:46,740 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-02-28 20:26:46,741 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-02-28 20:26:46,741 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-02-28 20:26:46,741 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2024-02-28 20:26:46,746 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,762 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,781 INFO  L138                Inliner]: procedures = 281, calls = 30, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132
[2024-02-28 20:26:46,781 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-02-28 20:26:46,782 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-02-28 20:26:46,782 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2024-02-28 20:26:46,782 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2024-02-28 20:26:46,789 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,789 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,793 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,793 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,800 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,803 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,804 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,806 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,808 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-02-28 20:26:46,809 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-02-28 20:26:46,809 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2024-02-28 20:26:46,809 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2024-02-28 20:26:46,810 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (1/1) ...
[2024-02-28 20:26:46,815 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-02-28 20:26:46,823 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:26:46,854 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-02-28 20:26:46,859 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-02-28 20:26:46,884 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~$Pointer$
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2024-02-28 20:26:46,885 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-02-28 20:26:46,886 INFO  L130     BoogieDeclarations]: Found specification of procedure ffs
[2024-02-28 20:26:46,886 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2024-02-28 20:26:46,886 INFO  L130     BoogieDeclarations]: Found specification of procedure thread
[2024-02-28 20:26:46,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure thread
[2024-02-28 20:26:46,886 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-02-28 20:26:46,886 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-02-28 20:26:46,887 WARN  L213             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement
[2024-02-28 20:26:47,035 INFO  L241             CfgBuilder]: Building ICFG
[2024-02-28 20:26:47,037 INFO  L267             CfgBuilder]: Building CFG for each procedure with an implementation
[2024-02-28 20:26:47,275 INFO  L282             CfgBuilder]: Performing block encoding
[2024-02-28 20:26:47,291 INFO  L304             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-02-28 20:26:47,291 INFO  L309             CfgBuilder]: Removed 2 assume(true) statements.
[2024-02-28 20:26:47,292 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:26:47 BoogieIcfgContainer
[2024-02-28 20:26:47,292 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-02-28 20:26:47,294 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-02-28 20:26:47,294 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2024-02-28 20:26:47,297 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2024-02-28 20:26:47,297 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.02 08:26:46" (1/3) ...
[2024-02-28 20:26:47,297 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aec044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:26:47, skipping insertion in model container
[2024-02-28 20:26:47,297 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.02 08:26:46" (2/3) ...
[2024-02-28 20:26:47,298 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32aec044 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 08:26:47, skipping insertion in model container
[2024-02-28 20:26:47,298 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 08:26:47" (3/3) ...
[2024-02-28 20:26:47,299 INFO  L112   eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask.i
[2024-02-28 20:26:47,305 WARN  L145   ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program
[2024-02-28 20:26:47,312 INFO  L203   ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-02-28 20:26:47,312 INFO  L162   ceAbstractionStarter]: Applying trace abstraction to program that has 13 error locations.
[2024-02-28 20:26:47,312 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2024-02-28 20:26:47,364 INFO  L144    ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions.
[2024-02-28 20:26:47,393 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 190 places, 198 transitions, 403 flow
[2024-02-28 20:26:47,457 INFO  L124   PetriNetUnfolderBase]: 16/287 cut-off events.
[2024-02-28 20:26:47,458 INFO  L125   PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES.
[2024-02-28 20:26:47,463 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 292 conditions, 287 events. 16/287 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 601 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 144. Up to 6 conditions per place. 
[2024-02-28 20:26:47,463 INFO  L82        GeneralOperation]: Start removeDead. Operand has 190 places, 198 transitions, 403 flow
[2024-02-28 20:26:47,467 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 190 places, 198 transitions, 403 flow
[2024-02-28 20:26:47,474 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:26:47,479 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@785837cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:26:47,480 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 18 error locations.
[2024-02-28 20:26:47,486 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:26:47,486 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-02-28 20:26:47,486 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:26:47,487 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:47,487 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:47,487 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:47,491 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:47,491 INFO  L85        PathProgramCache]: Analyzing trace with hash -813172429, now seen corresponding path program 1 times
[2024-02-28 20:26:47,497 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:47,497 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308018077]
[2024-02-28 20:26:47,498 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:47,498 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:47,581 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:47,664 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:47,664 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:47,665 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308018077]
[2024-02-28 20:26:47,665 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308018077] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:47,665 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:47,700 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:26:47,702 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4909096]
[2024-02-28 20:26:47,704 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:47,713 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:26:47,717 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:47,736 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:26:47,736 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:26:47,765 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-02-28 20:26:47,768 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 198 transitions, 403 flow. Second operand  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,768 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:47,769 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-02-28 20:26:47,769 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:47,844 INFO  L124   PetriNetUnfolderBase]: 34/480 cut-off events.
[2024-02-28 20:26:47,845 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 20:26:47,846 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 528 conditions, 480 events. 34/480 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1833 event pairs, 12 based on Foata normal form. 10/421 useless extension candidates. Maximal degree in co-relation 373. Up to 41 conditions per place. 
[2024-02-28 20:26:47,848 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 12 selfloop transitions, 2 changer transitions 2/193 dead transitions.
[2024-02-28 20:26:47,848 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 421 flow
[2024-02-28 20:26:47,850 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:26:47,851 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:26:47,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions.
[2024-02-28 20:26:47,860 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.936026936026936
[2024-02-28 20:26:47,860 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 556 transitions.
[2024-02-28 20:26:47,861 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions.
[2024-02-28 20:26:47,862 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:47,864 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions.
[2024-02-28 20:26:47,868 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,873 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,873 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,875 INFO  L175             Difference]: Start difference. First operand has 190 places, 198 transitions, 403 flow. Second operand 3 states and 556 transitions.
[2024-02-28 20:26:47,876 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 421 flow
[2024-02-28 20:26:47,879 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 193 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:26:47,882 INFO  L231             Difference]: Finished difference. Result has 191 places, 191 transitions, 393 flow
[2024-02-28 20:26:47,883 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=191, PETRI_TRANSITIONS=191}
[2024-02-28 20:26:47,886 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-02-28 20:26:47,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 191 transitions, 393 flow
[2024-02-28 20:26:47,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:47,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:47,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-02-28 20:26:47,887 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:47,888 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:47,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -295081930, now seen corresponding path program 1 times
[2024-02-28 20:26:47,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:47,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010769594]
[2024-02-28 20:26:47,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:47,889 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:47,908 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:47,948 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:47,949 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:47,949 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010769594]
[2024-02-28 20:26:47,949 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010769594] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:47,949 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:47,949 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:26:47,949 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061415215]
[2024-02-28 20:26:47,950 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:47,951 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:26:47,951 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:47,951 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:26:47,951 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:26:47,971 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-02-28 20:26:47,972 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 191 transitions, 393 flow. Second operand  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:47,972 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:47,972 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-02-28 20:26:47,972 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:48,052 INFO  L124   PetriNetUnfolderBase]: 87/676 cut-off events.
[2024-02-28 20:26:48,052 INFO  L125   PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES.
[2024-02-28 20:26:48,055 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 803 conditions, 676 events. 87/676 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3269 event pairs, 17 based on Foata normal form. 0/588 useless extension candidates. Maximal degree in co-relation 757. Up to 64 conditions per place. 
[2024-02-28 20:26:48,057 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 21 selfloop transitions, 8 changer transitions 0/203 dead transitions.
[2024-02-28 20:26:48,057 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 203 transitions, 475 flow
[2024-02-28 20:26:48,057 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:26:48,057 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:26:48,059 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 563 transitions.
[2024-02-28 20:26:48,059 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9478114478114478
[2024-02-28 20:26:48,059 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 563 transitions.
[2024-02-28 20:26:48,059 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 563 transitions.
[2024-02-28 20:26:48,060 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:48,060 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 563 transitions.
[2024-02-28 20:26:48,061 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,063 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,064 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,064 INFO  L175             Difference]: Start difference. First operand has 191 places, 191 transitions, 393 flow. Second operand 3 states and 563 transitions.
[2024-02-28 20:26:48,064 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 203 transitions, 475 flow
[2024-02-28 20:26:48,065 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 203 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:26:48,067 INFO  L231             Difference]: Finished difference. Result has 191 places, 199 transitions, 459 flow
[2024-02-28 20:26:48,068 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=459, PETRI_PLACES=191, PETRI_TRANSITIONS=199}
[2024-02-28 20:26:48,068 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 1 predicate places.
[2024-02-28 20:26:48,069 INFO  L495      AbstractCegarLoop]: Abstraction has has 191 places, 199 transitions, 459 flow
[2024-02-28 20:26:48,069 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,069 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:48,069 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:48,069 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-02-28 20:26:48,070 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:48,070 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:48,070 INFO  L85        PathProgramCache]: Analyzing trace with hash -82050404, now seen corresponding path program 1 times
[2024-02-28 20:26:48,070 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:48,070 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237324189]
[2024-02-28 20:26:48,070 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:48,071 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:48,113 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:48,194 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:48,194 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:48,194 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237324189]
[2024-02-28 20:26:48,194 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237324189] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:48,194 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:48,195 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:26:48,195 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131470555]
[2024-02-28 20:26:48,195 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:48,195 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:26:48,195 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:48,196 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:26:48,196 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:26:48,245 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-02-28 20:26:48,246 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 199 transitions, 459 flow. Second operand  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,246 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:48,246 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-02-28 20:26:48,246 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:48,329 INFO  L124   PetriNetUnfolderBase]: 68/710 cut-off events.
[2024-02-28 20:26:48,329 INFO  L125   PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES.
[2024-02-28 20:26:48,331 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 874 conditions, 710 events. 68/710 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3462 event pairs, 7 based on Foata normal form. 1/622 useless extension candidates. Maximal degree in co-relation 685. Up to 61 conditions per place. 
[2024-02-28 20:26:48,333 INFO  L140   encePairwiseOnDemand]: 190/198 looper letters, 19 selfloop transitions, 6 changer transitions 1/208 dead transitions.
[2024-02-28 20:26:48,333 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 208 transitions, 529 flow
[2024-02-28 20:26:48,333 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:26:48,333 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:26:48,335 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1089 transitions.
[2024-02-28 20:26:48,335 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9166666666666666
[2024-02-28 20:26:48,335 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1089 transitions.
[2024-02-28 20:26:48,336 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1089 transitions.
[2024-02-28 20:26:48,336 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:48,336 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1089 transitions.
[2024-02-28 20:26:48,338 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,341 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,341 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,341 INFO  L175             Difference]: Start difference. First operand has 191 places, 199 transitions, 459 flow. Second operand 6 states and 1089 transitions.
[2024-02-28 20:26:48,342 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 208 transitions, 529 flow
[2024-02-28 20:26:48,344 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 208 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:26:48,346 INFO  L231             Difference]: Finished difference. Result has 198 places, 203 transitions, 485 flow
[2024-02-28 20:26:48,346 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=198, PETRI_TRANSITIONS=203}
[2024-02-28 20:26:48,347 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 8 predicate places.
[2024-02-28 20:26:48,347 INFO  L495      AbstractCegarLoop]: Abstraction has has 198 places, 203 transitions, 485 flow
[2024-02-28 20:26:48,348 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,348 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:48,348 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:48,348 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-02-28 20:26:48,348 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:48,348 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:48,349 INFO  L85        PathProgramCache]: Analyzing trace with hash -1864871781, now seen corresponding path program 1 times
[2024-02-28 20:26:48,349 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:48,349 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442394119]
[2024-02-28 20:26:48,349 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:48,349 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:48,366 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:48,668 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:48,668 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:48,668 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442394119]
[2024-02-28 20:26:48,669 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442394119] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:48,669 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:48,669 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:26:48,669 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166962319]
[2024-02-28 20:26:48,669 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:48,670 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:26:48,670 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:48,670 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:26:48,671 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:26:48,859 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 198
[2024-02-28 20:26:48,860 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 203 transitions, 485 flow. Second operand  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:48,860 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:48,860 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 198
[2024-02-28 20:26:48,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:49,086 INFO  L124   PetriNetUnfolderBase]: 300/1732 cut-off events.
[2024-02-28 20:26:49,086 INFO  L125   PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES.
[2024-02-28 20:26:49,088 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2381 conditions, 1732 events. 300/1732 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 12628 event pairs, 35 based on Foata normal form. 0/1526 useless extension candidates. Maximal degree in co-relation 2225. Up to 300 conditions per place. 
[2024-02-28 20:26:49,092 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 52 selfloop transitions, 29 changer transitions 0/252 dead transitions.
[2024-02-28 20:26:49,092 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 252 transitions, 748 flow
[2024-02-28 20:26:49,092 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:26:49,092 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:26:49,094 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1056 transitions.
[2024-02-28 20:26:49,094 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8888888888888888
[2024-02-28 20:26:49,094 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1056 transitions.
[2024-02-28 20:26:49,095 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1056 transitions.
[2024-02-28 20:26:49,095 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:49,095 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1056 transitions.
[2024-02-28 20:26:49,097 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,099 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,100 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,100 INFO  L175             Difference]: Start difference. First operand has 198 places, 203 transitions, 485 flow. Second operand 6 states and 1056 transitions.
[2024-02-28 20:26:49,100 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 252 transitions, 748 flow
[2024-02-28 20:26:49,102 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 252 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:26:49,104 INFO  L231             Difference]: Finished difference. Result has 207 places, 232 transitions, 703 flow
[2024-02-28 20:26:49,105 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=703, PETRI_PLACES=207, PETRI_TRANSITIONS=232}
[2024-02-28 20:26:49,105 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 17 predicate places.
[2024-02-28 20:26:49,105 INFO  L495      AbstractCegarLoop]: Abstraction has has 207 places, 232 transitions, 703 flow
[2024-02-28 20:26:49,106 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.16666666666666) internal successors, (979), 6 states have internal predecessors, (979), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,106 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:49,106 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:49,106 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-02-28 20:26:49,106 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:49,107 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:49,107 INFO  L85        PathProgramCache]: Analyzing trace with hash -711875198, now seen corresponding path program 1 times
[2024-02-28 20:26:49,107 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:49,107 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378323263]
[2024-02-28 20:26:49,107 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:49,108 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:49,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:49,136 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:49,137 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:49,137 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378323263]
[2024-02-28 20:26:49,137 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378323263] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:49,137 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:49,137 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:26:49,137 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224305973]
[2024-02-28 20:26:49,138 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:49,138 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:26:49,138 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:49,139 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:26:49,139 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:26:49,148 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 181 out of 198
[2024-02-28 20:26:49,149 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 232 transitions, 703 flow. Second operand  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,149 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:49,149 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 198
[2024-02-28 20:26:49,149 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:49,282 INFO  L124   PetriNetUnfolderBase]: 205/1519 cut-off events.
[2024-02-28 20:26:49,282 INFO  L125   PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES.
[2024-02-28 20:26:49,285 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2201 conditions, 1519 events. 205/1519 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10702 event pairs, 20 based on Foata normal form. 0/1358 useless extension candidates. Maximal degree in co-relation 1935. Up to 114 conditions per place. 
[2024-02-28 20:26:49,289 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 13 selfloop transitions, 2 changer transitions 4/234 dead transitions.
[2024-02-28 20:26:49,289 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 234 transitions, 737 flow
[2024-02-28 20:26:49,289 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:26:49,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:26:49,290 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions.
[2024-02-28 20:26:49,290 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9427609427609428
[2024-02-28 20:26:49,290 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 560 transitions.
[2024-02-28 20:26:49,291 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 560 transitions.
[2024-02-28 20:26:49,291 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:49,291 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 560 transitions.
[2024-02-28 20:26:49,292 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,293 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,294 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,294 INFO  L175             Difference]: Start difference. First operand has 207 places, 232 transitions, 703 flow. Second operand 3 states and 560 transitions.
[2024-02-28 20:26:49,294 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 234 transitions, 737 flow
[2024-02-28 20:26:49,297 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 234 transitions, 737 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:26:49,299 INFO  L231             Difference]: Finished difference. Result has 208 places, 228 transitions, 689 flow
[2024-02-28 20:26:49,299 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=208, PETRI_TRANSITIONS=228}
[2024-02-28 20:26:49,300 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 18 predicate places.
[2024-02-28 20:26:49,300 INFO  L495      AbstractCegarLoop]: Abstraction has has 208 places, 228 transitions, 689 flow
[2024-02-28 20:26:49,301 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.0) internal successors, (546), 3 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,301 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:49,301 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:49,301 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-02-28 20:26:49,301 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:49,301 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:49,301 INFO  L85        PathProgramCache]: Analyzing trace with hash 998888802, now seen corresponding path program 1 times
[2024-02-28 20:26:49,301 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:49,302 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339364291]
[2024-02-28 20:26:49,302 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:49,302 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:49,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:49,380 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:49,381 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:49,381 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339364291]
[2024-02-28 20:26:49,381 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339364291] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:49,381 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:49,381 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:26:49,381 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102114023]
[2024-02-28 20:26:49,381 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:49,382 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:26:49,382 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:49,382 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:26:49,382 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:26:49,425 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-02-28 20:26:49,426 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 228 transitions, 689 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,426 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:49,426 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-02-28 20:26:49,426 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:49,570 INFO  L124   PetriNetUnfolderBase]: 200/1438 cut-off events.
[2024-02-28 20:26:49,570 INFO  L125   PetriNetUnfolderBase]: For 96/96 co-relation queries the response was YES.
[2024-02-28 20:26:49,573 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2179 conditions, 1438 events. 200/1438 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10064 event pairs, 35 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-02-28 20:26:49,576 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-02-28 20:26:49,577 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 234 transitions, 743 flow
[2024-02-28 20:26:49,577 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:26:49,577 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:26:49,578 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-02-28 20:26:49,579 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-02-28 20:26:49,579 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-02-28 20:26:49,579 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-02-28 20:26:49,579 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:49,579 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-02-28 20:26:49,581 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,582 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,582 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,582 INFO  L175             Difference]: Start difference. First operand has 208 places, 228 transitions, 689 flow. Second operand 4 states and 738 transitions.
[2024-02-28 20:26:49,582 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 234 transitions, 743 flow
[2024-02-28 20:26:49,586 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 234 transitions, 731 flow, removed 5 selfloop flow, removed 4 redundant places.
[2024-02-28 20:26:49,589 INFO  L231             Difference]: Finished difference. Result has 206 places, 231 transitions, 702 flow
[2024-02-28 20:26:49,590 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=702, PETRI_PLACES=206, PETRI_TRANSITIONS=231}
[2024-02-28 20:26:49,591 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 16 predicate places.
[2024-02-28 20:26:49,591 INFO  L495      AbstractCegarLoop]: Abstraction has has 206 places, 231 transitions, 702 flow
[2024-02-28 20:26:49,591 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,591 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:49,591 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:49,592 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-02-28 20:26:49,592 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:49,592 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:49,592 INFO  L85        PathProgramCache]: Analyzing trace with hash -1300362968, now seen corresponding path program 1 times
[2024-02-28 20:26:49,592 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:49,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066899246]
[2024-02-28 20:26:49,593 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:49,593 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:49,603 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:49,652 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:49,652 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:49,652 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066899246]
[2024-02-28 20:26:49,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066899246] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:49,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:49,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:26:49,653 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189579694]
[2024-02-28 20:26:49,653 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:49,653 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:26:49,653 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:49,654 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:26:49,654 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:26:49,704 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-02-28 20:26:49,705 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 231 transitions, 702 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,705 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:49,705 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-02-28 20:26:49,705 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:49,835 INFO  L124   PetriNetUnfolderBase]: 199/1436 cut-off events.
[2024-02-28 20:26:49,835 INFO  L125   PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES.
[2024-02-28 20:26:49,838 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2181 conditions, 1436 events. 199/1436 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10049 event pairs, 35 based on Foata normal form. 1/1292 useless extension candidates. Maximal degree in co-relation 2018. Up to 138 conditions per place. 
[2024-02-28 20:26:49,840 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 16 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-02-28 20:26:49,841 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 233 transitions, 746 flow
[2024-02-28 20:26:49,841 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:26:49,841 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:26:49,842 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 737 transitions.
[2024-02-28 20:26:49,842 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9305555555555556
[2024-02-28 20:26:49,843 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 737 transitions.
[2024-02-28 20:26:49,843 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 737 transitions.
[2024-02-28 20:26:49,844 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:49,844 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 737 transitions.
[2024-02-28 20:26:49,845 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.25) internal successors, (737), 4 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,846 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,846 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,846 INFO  L175             Difference]: Start difference. First operand has 206 places, 231 transitions, 702 flow. Second operand 4 states and 737 transitions.
[2024-02-28 20:26:49,846 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 233 transitions, 746 flow
[2024-02-28 20:26:49,849 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 233 transitions, 746 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:26:49,851 INFO  L231             Difference]: Finished difference. Result has 211 places, 232 transitions, 721 flow
[2024-02-28 20:26:49,851 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=206, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=721, PETRI_PLACES=211, PETRI_TRANSITIONS=232}
[2024-02-28 20:26:49,852 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 21 predicate places.
[2024-02-28 20:26:49,852 INFO  L495      AbstractCegarLoop]: Abstraction has has 211 places, 232 transitions, 721 flow
[2024-02-28 20:26:49,852 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,852 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:49,852 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:49,852 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-02-28 20:26:49,853 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:49,853 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:49,853 INFO  L85        PathProgramCache]: Analyzing trace with hash -672727897, now seen corresponding path program 1 times
[2024-02-28 20:26:49,853 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:49,853 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445010647]
[2024-02-28 20:26:49,853 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:49,853 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:49,863 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:49,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:49,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:49,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445010647]
[2024-02-28 20:26:49,911 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445010647] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:49,911 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:49,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:26:49,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993234040]
[2024-02-28 20:26:49,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:49,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:26:49,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:49,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:26:49,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:26:49,976 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-02-28 20:26:49,976 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 232 transitions, 721 flow. Second operand  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:49,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:49,977 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-02-28 20:26:49,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:50,140 INFO  L124   PetriNetUnfolderBase]: 198/1434 cut-off events.
[2024-02-28 20:26:50,141 INFO  L125   PetriNetUnfolderBase]: For 131/131 co-relation queries the response was YES.
[2024-02-28 20:26:50,144 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2202 conditions, 1434 events. 198/1434 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10063 event pairs, 35 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2085. Up to 138 conditions per place. 
[2024-02-28 20:26:50,146 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/234 dead transitions.
[2024-02-28 20:26:50,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 234 transitions, 767 flow
[2024-02-28 20:26:50,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:26:50,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:26:50,148 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 738 transitions.
[2024-02-28 20:26:50,149 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9318181818181818
[2024-02-28 20:26:50,149 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 738 transitions.
[2024-02-28 20:26:50,149 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 738 transitions.
[2024-02-28 20:26:50,149 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:50,149 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 738 transitions.
[2024-02-28 20:26:50,151 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 184.5) internal successors, (738), 4 states have internal predecessors, (738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,152 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,152 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,152 INFO  L175             Difference]: Start difference. First operand has 211 places, 232 transitions, 721 flow. Second operand 4 states and 738 transitions.
[2024-02-28 20:26:50,153 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 234 transitions, 767 flow
[2024-02-28 20:26:50,156 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 234 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:26:50,158 INFO  L231             Difference]: Finished difference. Result has 214 places, 232 transitions, 730 flow
[2024-02-28 20:26:50,158 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=730, PETRI_PLACES=214, PETRI_TRANSITIONS=232}
[2024-02-28 20:26:50,159 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 24 predicate places.
[2024-02-28 20:26:50,159 INFO  L495      AbstractCegarLoop]: Abstraction has has 214 places, 232 transitions, 730 flow
[2024-02-28 20:26:50,159 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 180.5) internal successors, (722), 4 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,159 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:50,159 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:50,160 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-02-28 20:26:50,160 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:50,160 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:50,160 INFO  L85        PathProgramCache]: Analyzing trace with hash 1064911265, now seen corresponding path program 1 times
[2024-02-28 20:26:50,160 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:50,160 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982996032]
[2024-02-28 20:26:50,160 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:50,161 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:50,170 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:50,211 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:50,212 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:50,212 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982996032]
[2024-02-28 20:26:50,212 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982996032] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:50,212 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:50,212 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:26:50,212 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274096711]
[2024-02-28 20:26:50,213 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:50,213 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:26:50,213 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:50,213 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:26:50,214 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:26:50,254 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 178 out of 198
[2024-02-28 20:26:50,255 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 232 transitions, 730 flow. Second operand  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,255 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:50,255 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 198
[2024-02-28 20:26:50,255 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:50,401 INFO  L124   PetriNetUnfolderBase]: 201/1436 cut-off events.
[2024-02-28 20:26:50,401 INFO  L125   PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES.
[2024-02-28 20:26:50,405 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1436 events. 201/1436 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10086 event pairs, 39 based on Foata normal form. 1/1298 useless extension candidates. Maximal degree in co-relation 2105. Up to 148 conditions per place. 
[2024-02-28 20:26:50,408 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 17 selfloop transitions, 4 changer transitions 0/233 dead transitions.
[2024-02-28 20:26:50,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 233 transitions, 774 flow
[2024-02-28 20:26:50,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:26:50,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:26:50,411 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 734 transitions.
[2024-02-28 20:26:50,411 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267676767676768
[2024-02-28 20:26:50,411 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 734 transitions.
[2024-02-28 20:26:50,411 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 734 transitions.
[2024-02-28 20:26:50,412 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:50,412 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 734 transitions.
[2024-02-28 20:26:50,413 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 183.5) internal successors, (734), 4 states have internal predecessors, (734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,414 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,414 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 198.0) internal successors, (990), 5 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,414 INFO  L175             Difference]: Start difference. First operand has 214 places, 232 transitions, 730 flow. Second operand 4 states and 734 transitions.
[2024-02-28 20:26:50,414 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 233 transitions, 774 flow
[2024-02-28 20:26:50,417 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 233 transitions, 766 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:26:50,419 INFO  L231             Difference]: Finished difference. Result has 215 places, 232 transitions, 734 flow
[2024-02-28 20:26:50,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=734, PETRI_PLACES=215, PETRI_TRANSITIONS=232}
[2024-02-28 20:26:50,420 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 25 predicate places.
[2024-02-28 20:26:50,420 INFO  L495      AbstractCegarLoop]: Abstraction has has 215 places, 232 transitions, 734 flow
[2024-02-28 20:26:50,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 179.5) internal successors, (718), 4 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,421 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:50,421 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:50,421 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-02-28 20:26:50,421 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:50,421 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:50,421 INFO  L85        PathProgramCache]: Analyzing trace with hash 694601576, now seen corresponding path program 1 times
[2024-02-28 20:26:50,421 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:50,422 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230272711]
[2024-02-28 20:26:50,422 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:50,422 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:50,431 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:50,447 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:50,447 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:50,447 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230272711]
[2024-02-28 20:26:50,448 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230272711] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:50,448 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:50,448 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:26:50,448 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264227170]
[2024-02-28 20:26:50,448 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:50,448 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:26:50,448 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:50,449 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:26:50,449 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:26:50,478 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 177 out of 198
[2024-02-28 20:26:50,479 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 232 transitions, 734 flow. Second operand  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,479 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:50,479 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 198
[2024-02-28 20:26:50,479 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:50,628 INFO  L124   PetriNetUnfolderBase]: 223/1511 cut-off events.
[2024-02-28 20:26:50,629 INFO  L125   PetriNetUnfolderBase]: For 184/193 co-relation queries the response was YES.
[2024-02-28 20:26:50,632 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2343 conditions, 1511 events. 223/1511 cut-off events. For 184/193 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10805 event pairs, 34 based on Foata normal form. 1/1363 useless extension candidates. Maximal degree in co-relation 2291. Up to 177 conditions per place. 
[2024-02-28 20:26:50,635 INFO  L140   encePairwiseOnDemand]: 192/198 looper letters, 22 selfloop transitions, 7 changer transitions 0/239 dead transitions.
[2024-02-28 20:26:50,635 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 239 transitions, 812 flow
[2024-02-28 20:26:50,636 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:26:50,636 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:26:50,636 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions.
[2024-02-28 20:26:50,637 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9343434343434344
[2024-02-28 20:26:50,637 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 555 transitions.
[2024-02-28 20:26:50,637 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 555 transitions.
[2024-02-28 20:26:50,637 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:50,637 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 555 transitions.
[2024-02-28 20:26:50,638 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,639 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,639 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,640 INFO  L175             Difference]: Start difference. First operand has 215 places, 232 transitions, 734 flow. Second operand 3 states and 555 transitions.
[2024-02-28 20:26:50,640 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 239 transitions, 812 flow
[2024-02-28 20:26:50,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 239 transitions, 804 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:26:50,644 INFO  L231             Difference]: Finished difference. Result has 216 places, 237 transitions, 782 flow
[2024-02-28 20:26:50,645 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=782, PETRI_PLACES=216, PETRI_TRANSITIONS=237}
[2024-02-28 20:26:50,645 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 26 predicate places.
[2024-02-28 20:26:50,645 INFO  L495      AbstractCegarLoop]: Abstraction has has 216 places, 237 transitions, 782 flow
[2024-02-28 20:26:50,645 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:50,645 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:50,646 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:50,646 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-02-28 20:26:50,646 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:50,646 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:50,646 INFO  L85        PathProgramCache]: Analyzing trace with hash -1419004448, now seen corresponding path program 1 times
[2024-02-28 20:26:50,646 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:50,646 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448168954]
[2024-02-28 20:26:50,646 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:50,646 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:50,666 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:50,947 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:50,947 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:50,947 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448168954]
[2024-02-28 20:26:50,947 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448168954] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:50,947 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:50,947 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:26:50,947 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664933206]
[2024-02-28 20:26:50,947 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:50,948 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:26:50,948 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:50,948 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:26:50,948 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:26:51,083 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 161 out of 198
[2024-02-28 20:26:51,084 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 237 transitions, 782 flow. Second operand  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,084 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:51,084 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 198
[2024-02-28 20:26:51,084 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:51,485 INFO  L124   PetriNetUnfolderBase]: 567/2728 cut-off events.
[2024-02-28 20:26:51,485 INFO  L125   PetriNetUnfolderBase]: For 658/713 co-relation queries the response was YES.
[2024-02-28 20:26:51,489 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 4921 conditions, 2728 events. 567/2728 cut-off events. For 658/713 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 22383 event pairs, 129 based on Foata normal form. 9/2479 useless extension candidates. Maximal degree in co-relation 4874. Up to 768 conditions per place. 
[2024-02-28 20:26:51,495 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 64 selfloop transitions, 83 changer transitions 0/326 dead transitions.
[2024-02-28 20:26:51,495 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 326 transitions, 1428 flow
[2024-02-28 20:26:51,496 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:26:51,496 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:26:51,498 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1077 transitions.
[2024-02-28 20:26:51,498 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9065656565656566
[2024-02-28 20:26:51,498 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1077 transitions.
[2024-02-28 20:26:51,498 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1077 transitions.
[2024-02-28 20:26:51,499 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:51,499 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1077 transitions.
[2024-02-28 20:26:51,501 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 179.5) internal successors, (1077), 6 states have internal predecessors, (1077), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,502 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,503 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,503 INFO  L175             Difference]: Start difference. First operand has 216 places, 237 transitions, 782 flow. Second operand 6 states and 1077 transitions.
[2024-02-28 20:26:51,503 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 326 transitions, 1428 flow
[2024-02-28 20:26:51,507 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 326 transitions, 1414 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:26:51,510 INFO  L231             Difference]: Finished difference. Result has 224 places, 318 transitions, 1504 flow
[2024-02-28 20:26:51,511 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=768, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=224, PETRI_TRANSITIONS=318}
[2024-02-28 20:26:51,511 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 34 predicate places.
[2024-02-28 20:26:51,511 INFO  L495      AbstractCegarLoop]: Abstraction has has 224 places, 318 transitions, 1504 flow
[2024-02-28 20:26:51,512 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 163.66666666666666) internal successors, (982), 6 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,512 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:51,512 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:51,512 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-02-28 20:26:51,512 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:51,512 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:51,512 INFO  L85        PathProgramCache]: Analyzing trace with hash -1205731276, now seen corresponding path program 1 times
[2024-02-28 20:26:51,512 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:51,512 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59350735]
[2024-02-28 20:26:51,512 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:51,513 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:51,531 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:51,791 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:26:51,791 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:51,791 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59350735]
[2024-02-28 20:26:51,792 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59350735] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:51,792 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:51,792 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:26:51,792 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381774574]
[2024-02-28 20:26:51,792 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:51,792 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:26:51,793 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:51,793 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:26:51,793 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:26:51,975 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 171 out of 198
[2024-02-28 20:26:51,977 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 318 transitions, 1504 flow. Second operand  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:51,977 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:51,977 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 198
[2024-02-28 20:26:51,977 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:52,287 INFO  L124   PetriNetUnfolderBase]: 520/2369 cut-off events.
[2024-02-28 20:26:52,287 INFO  L125   PetriNetUnfolderBase]: For 1360/1387 co-relation queries the response was YES.
[2024-02-28 20:26:52,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5136 conditions, 2369 events. 520/2369 cut-off events. For 1360/1387 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 18346 event pairs, 65 based on Foata normal form. 0/2205 useless extension candidates. Maximal degree in co-relation 5081. Up to 434 conditions per place. 
[2024-02-28 20:26:52,303 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 54 selfloop transitions, 43 changer transitions 12/366 dead transitions.
[2024-02-28 20:26:52,303 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 366 transitions, 2003 flow
[2024-02-28 20:26:52,304 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:26:52,304 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:26:52,305 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions.
[2024-02-28 20:26:52,306 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9090909090909091
[2024-02-28 20:26:52,306 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1080 transitions.
[2024-02-28 20:26:52,306 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1080 transitions.
[2024-02-28 20:26:52,307 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:52,307 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1080 transitions.
[2024-02-28 20:26:52,309 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 180.0) internal successors, (1080), 6 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:52,311 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:52,311 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 198.0) internal successors, (1386), 7 states have internal predecessors, (1386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:52,312 INFO  L175             Difference]: Start difference. First operand has 224 places, 318 transitions, 1504 flow. Second operand 6 states and 1080 transitions.
[2024-02-28 20:26:52,312 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 366 transitions, 2003 flow
[2024-02-28 20:26:52,321 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 366 transitions, 1949 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 20:26:52,325 INFO  L231             Difference]: Finished difference. Result has 234 places, 350 transitions, 1907 flow
[2024-02-28 20:26:52,325 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1907, PETRI_PLACES=234, PETRI_TRANSITIONS=350}
[2024-02-28 20:26:52,327 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 44 predicate places.
[2024-02-28 20:26:52,327 INFO  L495      AbstractCegarLoop]: Abstraction has has 234 places, 350 transitions, 1907 flow
[2024-02-28 20:26:52,327 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 172.83333333333334) internal successors, (1037), 6 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:52,328 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:52,328 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:52,328 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-02-28 20:26:52,328 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:52,329 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:52,329 INFO  L85        PathProgramCache]: Analyzing trace with hash -1781310048, now seen corresponding path program 1 times
[2024-02-28 20:26:52,329 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:52,329 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553140987]
[2024-02-28 20:26:52,329 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:52,329 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:52,362 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:52,722 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:52,722 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:52,722 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553140987]
[2024-02-28 20:26:52,722 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553140987] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:52,722 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:52,722 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:26:52,722 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044838335]
[2024-02-28 20:26:52,722 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:52,723 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:26:52,723 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:52,723 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:26:52,723 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:26:53,096 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 155 out of 198
[2024-02-28 20:26:53,098 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 350 transitions, 1907 flow. Second operand  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:53,098 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:53,098 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 198
[2024-02-28 20:26:53,098 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:53,834 INFO  L124   PetriNetUnfolderBase]: 628/2788 cut-off events.
[2024-02-28 20:26:53,834 INFO  L125   PetriNetUnfolderBase]: For 2185/2398 co-relation queries the response was YES.
[2024-02-28 20:26:53,843 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6653 conditions, 2788 events. 628/2788 cut-off events. For 2185/2398 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 23168 event pairs, 114 based on Foata normal form. 82/2655 useless extension candidates. Maximal degree in co-relation 6597. Up to 527 conditions per place. 
[2024-02-28 20:26:53,851 INFO  L140   encePairwiseOnDemand]: 182/198 looper letters, 220 selfloop transitions, 73 changer transitions 1/462 dead transitions.
[2024-02-28 20:26:53,851 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 462 transitions, 3201 flow
[2024-02-28 20:26:53,854 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 20:26:53,854 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 20:26:53,856 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1839 transitions.
[2024-02-28 20:26:53,857 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8443526170798898
[2024-02-28 20:26:53,857 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1839 transitions.
[2024-02-28 20:26:53,857 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1839 transitions.
[2024-02-28 20:26:53,858 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:53,858 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1839 transitions.
[2024-02-28 20:26:53,861 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 167.1818181818182) internal successors, (1839), 11 states have internal predecessors, (1839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:53,866 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:53,867 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:53,867 INFO  L175             Difference]: Start difference. First operand has 234 places, 350 transitions, 1907 flow. Second operand 11 states and 1839 transitions.
[2024-02-28 20:26:53,867 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 462 transitions, 3201 flow
[2024-02-28 20:26:53,880 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 462 transitions, 3165 flow, removed 18 selfloop flow, removed 0 redundant places.
[2024-02-28 20:26:53,885 INFO  L231             Difference]: Finished difference. Result has 246 places, 374 transitions, 2339 flow
[2024-02-28 20:26:53,886 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=1871, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2339, PETRI_PLACES=246, PETRI_TRANSITIONS=374}
[2024-02-28 20:26:53,886 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 56 predicate places.
[2024-02-28 20:26:53,886 INFO  L495      AbstractCegarLoop]: Abstraction has has 246 places, 374 transitions, 2339 flow
[2024-02-28 20:26:53,887 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 157.1) internal successors, (1571), 10 states have internal predecessors, (1571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:53,887 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:53,887 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:53,887 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-02-28 20:26:53,887 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:53,887 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:53,888 INFO  L85        PathProgramCache]: Analyzing trace with hash -644812780, now seen corresponding path program 1 times
[2024-02-28 20:26:53,888 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:53,888 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653591250]
[2024-02-28 20:26:53,888 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:53,888 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:53,905 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:54,215 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:26:54,216 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:54,216 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653591250]
[2024-02-28 20:26:54,216 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653591250] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:54,216 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:54,216 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:26:54,216 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810470192]
[2024-02-28 20:26:54,216 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:54,217 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:26:54,217 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:54,217 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:26:54,217 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:26:54,640 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 158 out of 198
[2024-02-28 20:26:54,642 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 374 transitions, 2339 flow. Second operand  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:54,643 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:54,643 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 198
[2024-02-28 20:26:54,643 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:55,161 INFO  L124   PetriNetUnfolderBase]: 536/2464 cut-off events.
[2024-02-28 20:26:55,161 INFO  L125   PetriNetUnfolderBase]: For 3896/4123 co-relation queries the response was YES.
[2024-02-28 20:26:55,171 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 6592 conditions, 2464 events. 536/2464 cut-off events. For 3896/4123 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 20465 event pairs, 84 based on Foata normal form. 48/2337 useless extension candidates. Maximal degree in co-relation 6525. Up to 634 conditions per place. 
[2024-02-28 20:26:55,177 INFO  L140   encePairwiseOnDemand]: 186/198 looper letters, 161 selfloop transitions, 18 changer transitions 1/382 dead transitions.
[2024-02-28 20:26:55,177 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 382 transitions, 2757 flow
[2024-02-28 20:26:55,180 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 20:26:55,180 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 20:26:55,182 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1627 transitions.
[2024-02-28 20:26:55,183 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8217171717171717
[2024-02-28 20:26:55,183 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1627 transitions.
[2024-02-28 20:26:55,183 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1627 transitions.
[2024-02-28 20:26:55,185 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:55,185 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1627 transitions.
[2024-02-28 20:26:55,189 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 162.7) internal successors, (1627), 10 states have internal predecessors, (1627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,193 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,194 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,194 INFO  L175             Difference]: Start difference. First operand has 246 places, 374 transitions, 2339 flow. Second operand 10 states and 1627 transitions.
[2024-02-28 20:26:55,194 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 382 transitions, 2757 flow
[2024-02-28 20:26:55,214 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 382 transitions, 2751 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:26:55,218 INFO  L231             Difference]: Finished difference. Result has 253 places, 375 transitions, 2405 flow
[2024-02-28 20:26:55,218 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2321, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2405, PETRI_PLACES=253, PETRI_TRANSITIONS=375}
[2024-02-28 20:26:55,219 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 63 predicate places.
[2024-02-28 20:26:55,219 INFO  L495      AbstractCegarLoop]: Abstraction has has 253 places, 375 transitions, 2405 flow
[2024-02-28 20:26:55,220 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 160.0) internal successors, (1600), 10 states have internal predecessors, (1600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,220 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:55,220 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:55,220 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-02-28 20:26:55,220 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:55,220 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:55,221 INFO  L85        PathProgramCache]: Analyzing trace with hash 2007230318, now seen corresponding path program 1 times
[2024-02-28 20:26:55,221 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:55,221 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474864259]
[2024-02-28 20:26:55,221 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:55,221 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:55,236 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:55,254 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:55,254 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:55,254 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474864259]
[2024-02-28 20:26:55,254 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474864259] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:55,254 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:26:55,254 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:26:55,254 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144106731]
[2024-02-28 20:26:55,254 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:55,255 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:26:55,255 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:55,255 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:26:55,255 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:26:55,273 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 179 out of 198
[2024-02-28 20:26:55,274 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 253 places, 375 transitions, 2405 flow. Second operand  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,274 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:55,274 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 198
[2024-02-28 20:26:55,274 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:55,512 INFO  L124   PetriNetUnfolderBase]: 494/2308 cut-off events.
[2024-02-28 20:26:55,512 INFO  L125   PetriNetUnfolderBase]: For 3299/3382 co-relation queries the response was YES.
[2024-02-28 20:26:55,520 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 2308 events. 494/2308 cut-off events. For 3299/3382 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 18535 event pairs, 47 based on Foata normal form. 13/2196 useless extension candidates. Maximal degree in co-relation 5873. Up to 279 conditions per place. 
[2024-02-28 20:26:55,524 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 20 selfloop transitions, 11 changer transitions 31/384 dead transitions.
[2024-02-28 20:26:55,525 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 384 transitions, 2499 flow
[2024-02-28 20:26:55,525 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:26:55,525 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:26:55,526 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions.
[2024-02-28 20:26:55,526 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9410774410774411
[2024-02-28 20:26:55,526 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 559 transitions.
[2024-02-28 20:26:55,526 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions.
[2024-02-28 20:26:55,527 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:55,527 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions.
[2024-02-28 20:26:55,527 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,528 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,528 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,528 INFO  L175             Difference]: Start difference. First operand has 253 places, 375 transitions, 2405 flow. Second operand 3 states and 559 transitions.
[2024-02-28 20:26:55,528 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 384 transitions, 2499 flow
[2024-02-28 20:26:55,547 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 384 transitions, 2463 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-02-28 20:26:55,551 INFO  L231             Difference]: Finished difference. Result has 252 places, 351 transitions, 2140 flow
[2024-02-28 20:26:55,551 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2369, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=375, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=252, PETRI_TRANSITIONS=351}
[2024-02-28 20:26:55,551 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 62 predicate places.
[2024-02-28 20:26:55,551 INFO  L495      AbstractCegarLoop]: Abstraction has has 252 places, 351 transitions, 2140 flow
[2024-02-28 20:26:55,552 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:55,552 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:55,552 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:55,552 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-02-28 20:26:55,552 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:55,552 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:55,552 INFO  L85        PathProgramCache]: Analyzing trace with hash -2049931052, now seen corresponding path program 1 times
[2024-02-28 20:26:55,552 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:55,553 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862072263]
[2024-02-28 20:26:55,553 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:55,553 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:55,579 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:56,148 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:26:56,148 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:26:56,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862072263]
[2024-02-28 20:26:56,149 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862072263] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:26:56,149 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049473872]
[2024-02-28 20:26:56,149 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:56,149 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:26:56,149 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:26:56,151 INFO  L229       MonitoredProcess]: Starting monitored process 2 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:26:56,153 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-02-28 20:26:56,312 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:26:56,314 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 34 conjunts are in the unsatisfiable core
[2024-02-28 20:26:56,326 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:26:56,385 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:26:56,461 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:26:56,461 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:26:56,825 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:26:56,825 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:26:56,890 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:26:56,891 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:26:56,974 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:26:56,989 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:26:56,997 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:26:57,013 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:26:57,013 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:26:57,039 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:26:57,040 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:26:57,070 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:26:57,085 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:26:57,085 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:26:57,085 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049473872] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:26:57,086 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:26:57,086 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [15] total 21
[2024-02-28 20:26:57,086 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347566962]
[2024-02-28 20:26:57,086 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:26:57,087 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-02-28 20:26:57,087 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:26:57,087 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-02-28 20:26:57,088 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462
[2024-02-28 20:26:57,842 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-02-28 20:26:57,843 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 351 transitions, 2140 flow. Second operand  has 14 states, 14 states have (on average 146.35714285714286) internal successors, (2049), 14 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:57,843 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:26:57,843 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-02-28 20:26:57,843 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:26:59,122 INFO  L124   PetriNetUnfolderBase]: 794/3373 cut-off events.
[2024-02-28 20:26:59,123 INFO  L125   PetriNetUnfolderBase]: For 5825/5829 co-relation queries the response was YES.
[2024-02-28 20:26:59,138 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 3373 events. 794/3373 cut-off events. For 5825/5829 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 28385 event pairs, 107 based on Foata normal form. 15/3233 useless extension candidates. Maximal degree in co-relation 9434. Up to 401 conditions per place. 
[2024-02-28 20:26:59,146 INFO  L140   encePairwiseOnDemand]: 179/198 looper letters, 284 selfloop transitions, 89 changer transitions 16/549 dead transitions.
[2024-02-28 20:26:59,146 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 549 transitions, 4716 flow
[2024-02-28 20:26:59,147 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. 
[2024-02-28 20:26:59,147 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 19 states.
[2024-02-28 20:26:59,150 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2870 transitions.
[2024-02-28 20:26:59,151 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7628920786815524
[2024-02-28 20:26:59,151 INFO  L72            ComplementDD]: Start complementDD. Operand 19 states and 2870 transitions.
[2024-02-28 20:26:59,151 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 19 states and 2870 transitions.
[2024-02-28 20:26:59,152 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:26:59,152 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2870 transitions.
[2024-02-28 20:26:59,156 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 20 states, 19 states have (on average 151.05263157894737) internal successors, (2870), 19 states have internal predecessors, (2870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:59,160 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:59,161 INFO  L81            ComplementDD]: Finished complementDD. Result  has 20 states, 20 states have (on average 198.0) internal successors, (3960), 20 states have internal predecessors, (3960), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:59,161 INFO  L175             Difference]: Start difference. First operand has 252 places, 351 transitions, 2140 flow. Second operand 19 states and 2870 transitions.
[2024-02-28 20:26:59,161 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 549 transitions, 4716 flow
[2024-02-28 20:26:59,187 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 549 transitions, 4683 flow, removed 2 selfloop flow, removed 5 redundant places.
[2024-02-28 20:26:59,193 INFO  L231             Difference]: Finished difference. Result has 269 places, 413 transitions, 3117 flow
[2024-02-28 20:26:59,193 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=2109, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=3117, PETRI_PLACES=269, PETRI_TRANSITIONS=413}
[2024-02-28 20:26:59,193 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 79 predicate places.
[2024-02-28 20:26:59,193 INFO  L495      AbstractCegarLoop]: Abstraction has has 269 places, 413 transitions, 3117 flow
[2024-02-28 20:26:59,194 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 146.35714285714286) internal successors, (2049), 14 states have internal predecessors, (2049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:26:59,194 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:26:59,194 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:26:59,200 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-02-28 20:26:59,398 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,2 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:26:59,399 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:26:59,400 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:26:59,400 INFO  L85        PathProgramCache]: Analyzing trace with hash 278629250, now seen corresponding path program 2 times
[2024-02-28 20:26:59,400 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:26:59,401 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793946153]
[2024-02-28 20:26:59,401 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:26:59,401 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:26:59,427 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:00,195 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:00,195 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:27:00,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793946153]
[2024-02-28 20:27:00,195 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793946153] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:27:00,195 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10690903]
[2024-02-28 20:27:00,195 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:27:00,195 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:00,195 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:27:00,197 INFO  L229       MonitoredProcess]: Starting monitored process 3 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:27:00,198 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-02-28 20:27:00,327 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:27:00,327 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:27:00,331 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-02-28 20:27:00,349 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:27:00,377 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:27:00,440 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:27:00,440 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:27:00,828 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:27:00,828 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:27:00,888 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:00,889 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:27:00,911 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:27:00,955 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:27:01,034 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:27:01,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:27:01,124 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:27:01,124 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:27:01,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:27:01,473 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:01,474 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:27:01,511 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:01,512 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:27:01,533 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:01,534 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:27:01,566 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:01,567 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:27:01,611 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:27:01,621 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:01,621 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:27:01,621 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [10690903] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:27:01,621 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:27:01,621 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-02-28 20:27:01,622 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811133821]
[2024-02-28 20:27:01,622 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:27:01,622 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:27:01,622 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:27:01,622 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:27:01,623 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-02-28 20:27:02,651 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 144 out of 198
[2024-02-28 20:27:02,652 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 413 transitions, 3117 flow. Second operand  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:02,652 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:27:02,652 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 198
[2024-02-28 20:27:02,652 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:27:04,777 INFO  L124   PetriNetUnfolderBase]: 786/3138 cut-off events.
[2024-02-28 20:27:04,778 INFO  L125   PetriNetUnfolderBase]: For 8610/8721 co-relation queries the response was YES.
[2024-02-28 20:27:04,788 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 10151 conditions, 3138 events. 786/3138 cut-off events. For 8610/8721 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 25764 event pairs, 86 based on Foata normal form. 29/3022 useless extension candidates. Maximal degree in co-relation 10048. Up to 562 conditions per place. 
[2024-02-28 20:27:04,794 INFO  L140   encePairwiseOnDemand]: 175/198 looper letters, 264 selfloop transitions, 133 changer transitions 16/573 dead transitions.
[2024-02-28 20:27:04,794 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 573 transitions, 5241 flow
[2024-02-28 20:27:04,795 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. 
[2024-02-28 20:27:04,795 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 24 states.
[2024-02-28 20:27:04,799 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 3643 transitions.
[2024-02-28 20:27:04,800 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7666245791245792
[2024-02-28 20:27:04,800 INFO  L72            ComplementDD]: Start complementDD. Operand 24 states and 3643 transitions.
[2024-02-28 20:27:04,801 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 24 states and 3643 transitions.
[2024-02-28 20:27:04,802 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:27:04,802 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 3643 transitions.
[2024-02-28 20:27:04,807 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 25 states, 24 states have (on average 151.79166666666666) internal successors, (3643), 24 states have internal predecessors, (3643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:04,812 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 25 states, 25 states have (on average 198.0) internal successors, (4950), 25 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:04,812 INFO  L81            ComplementDD]: Finished complementDD. Result  has 25 states, 25 states have (on average 198.0) internal successors, (4950), 25 states have internal predecessors, (4950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:04,812 INFO  L175             Difference]: Start difference. First operand has 269 places, 413 transitions, 3117 flow. Second operand 24 states and 3643 transitions.
[2024-02-28 20:27:04,812 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 573 transitions, 5241 flow
[2024-02-28 20:27:04,847 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 573 transitions, 5193 flow, removed 12 selfloop flow, removed 8 redundant places.
[2024-02-28 20:27:04,853 INFO  L231             Difference]: Finished difference. Result has 287 places, 454 transitions, 3864 flow
[2024-02-28 20:27:04,853 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3073, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=413, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=3864, PETRI_PLACES=287, PETRI_TRANSITIONS=454}
[2024-02-28 20:27:04,853 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 97 predicate places.
[2024-02-28 20:27:04,853 INFO  L495      AbstractCegarLoop]: Abstraction has has 287 places, 454 transitions, 3864 flow
[2024-02-28 20:27:04,854 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 146.2) internal successors, (2193), 15 states have internal predecessors, (2193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:04,854 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:27:04,854 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:27:04,860 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0
[2024-02-28 20:27:05,060 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16
[2024-02-28 20:27:05,062 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:27:05,062 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:27:05,063 INFO  L85        PathProgramCache]: Analyzing trace with hash -1070396938, now seen corresponding path program 3 times
[2024-02-28 20:27:05,063 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:27:05,064 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297106505]
[2024-02-28 20:27:05,064 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:27:05,064 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:27:05,105 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:05,853 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:05,853 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:27:05,853 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297106505]
[2024-02-28 20:27:05,854 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297106505] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:27:05,854 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678195349]
[2024-02-28 20:27:05,854 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:27:05,854 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:05,854 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:27:05,855 INFO  L229       MonitoredProcess]: Starting monitored process 4 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:27:05,857 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-02-28 20:27:06,000 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:27:06,001 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:27:06,005 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 72 conjunts are in the unsatisfiable core
[2024-02-28 20:27:06,024 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:27:06,154 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:27:06,260 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:27:06,260 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:27:07,271 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:27:07,272 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-02-28 20:27:07,278 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:07,278 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-02-28 20:27:07,568 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:07,569 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:27:07,577 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:07,579 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:27:07,658 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:27:07,740 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:27:08,168 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:27:08,178 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:27:08,238 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:27:08,309 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:27:08,387 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:08,388 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:08,423 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:08,424 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:08,456 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:08,456 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:08,490 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:08,492 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:08,578 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:08,624 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:08,625 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:27:08,625 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678195349] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:27:08,625 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:27:08,625 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-02-28 20:27:08,626 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802101417]
[2024-02-28 20:27:08,626 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:27:08,626 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-02-28 20:27:08,626 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:27:08,627 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-02-28 20:27:08,627 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1242, Unknown=0, NotChecked=0, Total=1406
[2024-02-28 20:27:11,205 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 121 out of 198
[2024-02-28 20:27:11,207 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 454 transitions, 3864 flow. Second operand  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:11,207 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:27:11,207 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 198
[2024-02-28 20:27:11,207 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:27:17,163 INFO  L124   PetriNetUnfolderBase]: 2471/9037 cut-off events.
[2024-02-28 20:27:17,163 INFO  L125   PetriNetUnfolderBase]: For 32502/32553 co-relation queries the response was YES.
[2024-02-28 20:27:17,197 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 30987 conditions, 9037 events. 2471/9037 cut-off events. For 32502/32553 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 92603 event pairs, 504 based on Foata normal form. 48/8615 useless extension candidates. Maximal degree in co-relation 29073. Up to 1883 conditions per place. 
[2024-02-28 20:27:17,220 INFO  L140   encePairwiseOnDemand]: 159/198 looper letters, 828 selfloop transitions, 248 changer transitions 33/1247 dead transitions.
[2024-02-28 20:27:17,220 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 1247 transitions, 13745 flow
[2024-02-28 20:27:17,220 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2024-02-28 20:27:17,221 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2024-02-28 20:27:17,224 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 6377 transitions.
[2024-02-28 20:27:17,226 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.6572871572871573
[2024-02-28 20:27:17,226 INFO  L72            ComplementDD]: Start complementDD. Operand 49 states and 6377 transitions.
[2024-02-28 20:27:17,226 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 49 states and 6377 transitions.
[2024-02-28 20:27:17,227 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:27:17,227 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 6377 transitions.
[2024-02-28 20:27:17,234 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 50 states, 49 states have (on average 130.14285714285714) internal successors, (6377), 49 states have internal predecessors, (6377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:17,242 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 50 states, 50 states have (on average 198.0) internal successors, (9900), 50 states have internal predecessors, (9900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:17,243 INFO  L81            ComplementDD]: Finished complementDD. Result  has 50 states, 50 states have (on average 198.0) internal successors, (9900), 50 states have internal predecessors, (9900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:17,243 INFO  L175             Difference]: Start difference. First operand has 287 places, 454 transitions, 3864 flow. Second operand 49 states and 6377 transitions.
[2024-02-28 20:27:17,243 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 1247 transitions, 13745 flow
[2024-02-28 20:27:17,374 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 1247 transitions, 13141 flow, removed 108 selfloop flow, removed 11 redundant places.
[2024-02-28 20:27:17,385 INFO  L231             Difference]: Finished difference. Result has 353 places, 672 transitions, 7230 flow
[2024-02-28 20:27:17,385 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3634, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=7230, PETRI_PLACES=353, PETRI_TRANSITIONS=672}
[2024-02-28 20:27:17,386 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 163 predicate places.
[2024-02-28 20:27:17,386 INFO  L495      AbstractCegarLoop]: Abstraction has has 353 places, 672 transitions, 7230 flow
[2024-02-28 20:27:17,387 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 123.16666666666667) internal successors, (2956), 24 states have internal predecessors, (2956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:17,387 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:27:17,387 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:27:17,392 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-02-28 20:27:17,588 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17
[2024-02-28 20:27:17,590 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:27:17,591 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:27:17,591 INFO  L85        PathProgramCache]: Analyzing trace with hash 805770226, now seen corresponding path program 1 times
[2024-02-28 20:27:17,591 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:27:17,592 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673862548]
[2024-02-28 20:27:17,592 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:27:17,592 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:27:17,617 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:18,238 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:18,238 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:27:18,238 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673862548]
[2024-02-28 20:27:18,239 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673862548] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:27:18,239 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088983682]
[2024-02-28 20:27:18,239 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:27:18,239 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:18,239 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:27:18,240 INFO  L229       MonitoredProcess]: Starting monitored process 5 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:27:18,242 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-02-28 20:27:18,376 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:18,379 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 53 conjunts are in the unsatisfiable core
[2024-02-28 20:27:18,387 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:27:18,486 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:27:18,549 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:27:18,550 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:27:18,676 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:18,682 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:27:18,683 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-02-28 20:27:19,195 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:27:19,195 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 44
[2024-02-28 20:27:19,201 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-02-28 20:27:19,273 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:19,273 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-02-28 20:27:19,280 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:19,281 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:27:19,416 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:27:19,420 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:27:19,480 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:27:19,520 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:27:19,581 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:27:19,625 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:27:19,676 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:19,715 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:19,715 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:27:19,745 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false
[2024-02-28 20:27:19,774 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)))))) is different from false
[2024-02-28 20:27:19,795 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) (.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_734 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_734) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:27:19,912 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_728 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:27:20,002 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_728 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_726) c_~datas~0.base v_ArrVal_728) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:27:20,328 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119
[2024-02-28 20:27:20,334 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-02-28 20:27:20,338 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-02-28 20:27:20,397 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-02-28 20:27:20,551 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:20,551 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088983682] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:27:20,551 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:27:20,551 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 19, 17] total 46
[2024-02-28 20:27:20,551 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146130362]
[2024-02-28 20:27:20,552 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:27:20,552 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 47 states
[2024-02-28 20:27:20,553 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:27:20,553 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants.
[2024-02-28 20:27:20,553 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1531, Unknown=16, NotChecked=420, Total=2162
[2024-02-28 20:27:20,607 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 106 out of 198
[2024-02-28 20:27:20,610 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 672 transitions, 7230 flow. Second operand  has 47 states, 47 states have (on average 109.12765957446808) internal successors, (5129), 47 states have internal predecessors, (5129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:20,610 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:27:20,610 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 198
[2024-02-28 20:27:20,610 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:27:25,332 INFO  L124   PetriNetUnfolderBase]: 2487/9627 cut-off events.
[2024-02-28 20:27:25,332 INFO  L125   PetriNetUnfolderBase]: For 51646/51663 co-relation queries the response was YES.
[2024-02-28 20:27:25,382 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36795 conditions, 9627 events. 2487/9627 cut-off events. For 51646/51663 co-relation queries the response was YES. Maximal size of possible extension queue 358. Compared 101766 event pairs, 238 based on Foata normal form. 58/9326 useless extension candidates. Maximal degree in co-relation 36475. Up to 1220 conditions per place. 
[2024-02-28 20:27:25,400 INFO  L140   encePairwiseOnDemand]: 167/198 looper letters, 471 selfloop transitions, 124 changer transitions 169/937 dead transitions.
[2024-02-28 20:27:25,401 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 937 transitions, 12189 flow
[2024-02-28 20:27:25,401 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. 
[2024-02-28 20:27:25,401 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2024-02-28 20:27:25,403 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 3184 transitions.
[2024-02-28 20:27:25,404 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5743145743145743
[2024-02-28 20:27:25,404 INFO  L72            ComplementDD]: Start complementDD. Operand 28 states and 3184 transitions.
[2024-02-28 20:27:25,404 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 28 states and 3184 transitions.
[2024-02-28 20:27:25,405 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:27:25,405 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 28 states and 3184 transitions.
[2024-02-28 20:27:25,408 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 29 states, 28 states have (on average 113.71428571428571) internal successors, (3184), 28 states have internal predecessors, (3184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:25,412 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:25,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 29 states, 29 states have (on average 198.0) internal successors, (5742), 29 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:25,413 INFO  L175             Difference]: Start difference. First operand has 353 places, 672 transitions, 7230 flow. Second operand 28 states and 3184 transitions.
[2024-02-28 20:27:25,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 937 transitions, 12189 flow
[2024-02-28 20:27:25,682 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 937 transitions, 11940 flow, removed 79 selfloop flow, removed 13 redundant places.
[2024-02-28 20:27:25,691 INFO  L231             Difference]: Finished difference. Result has 365 places, 591 transitions, 5869 flow
[2024-02-28 20:27:25,692 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=7040, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=106, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=5869, PETRI_PLACES=365, PETRI_TRANSITIONS=591}
[2024-02-28 20:27:25,692 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 175 predicate places.
[2024-02-28 20:27:25,692 INFO  L495      AbstractCegarLoop]: Abstraction has has 365 places, 591 transitions, 5869 flow
[2024-02-28 20:27:25,693 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 47 states, 47 states have (on average 109.12765957446808) internal successors, (5129), 47 states have internal predecessors, (5129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:25,693 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:27:25,694 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:27:25,701 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0
[2024-02-28 20:27:25,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:25,895 INFO  L420      AbstractCegarLoop]: === Iteration 20 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:27:25,895 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:27:25,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 79957040, now seen corresponding path program 4 times
[2024-02-28 20:27:25,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:27:25,896 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78945452]
[2024-02-28 20:27:25,896 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:27:25,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:27:25,922 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:26,557 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:26,557 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:27:26,557 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78945452]
[2024-02-28 20:27:26,557 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78945452] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:27:26,558 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061450729]
[2024-02-28 20:27:26,558 INFO  L93    rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST
[2024-02-28 20:27:26,558 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:26,558 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:27:26,560 INFO  L229       MonitoredProcess]: Starting monitored process 6 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:27:26,561 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process
[2024-02-28 20:27:26,777 INFO  L228   tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s)
[2024-02-28 20:27:26,777 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:27:26,779 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 62 conjunts are in the unsatisfiable core
[2024-02-28 20:27:26,784 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:27:26,896 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:27:26,984 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:27:26,984 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:27:27,839 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:27:27,839 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:27:28,094 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:28,094 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:27:28,231 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:27:28,361 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:27:28,414 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:27:28,472 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:27:28,548 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:28,549 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21
[2024-02-28 20:27:28,585 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:27:28,670 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:28,671 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:28,697 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:28,698 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:28,715 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:28,716 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:28,804 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:28,848 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:28,848 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:27:28,869 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 20:27:28,911 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 20:27:28,956 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))))))) is different from false
[2024-02-28 20:27:28,975 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse0 (+ c_~datas~0.offset 3 .cse1))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) .cse0) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store |c_#race| |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse0 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|))))) is different from false
[2024-02-28 20:27:29,002 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse3))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse3 1)))) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-02-28 20:27:29,237 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse3 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse4 (+ c_~datas~0.offset .cse3 1)) (.cse5 (+ c_~datas~0.offset 2 .cse3))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse5 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (+ c_~datas~0.offset 3 .cse3)) (.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) .cse2 v_ArrVal_845) c_~datas~0.base) (+ c_~datas~0.offset .cse3)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) .cse2 v_ArrVal_845) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) .cse2 v_ArrVal_845) c_~datas~0.base) .cse1) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_845 (Array Int Int)) (v_ArrVal_844 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (= (select (select (store (store (store |c_#race| c_~datas~0.base (store (select (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_840) c_~datas~0.base) .cse1 |c_threadThread1of1ForFork0_#t~nondet4|)) |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_844) .cse2 v_ArrVal_845) c_~datas~0.base) .cse5) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-02-28 20:27:29,309 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:27:29,309 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 129
[2024-02-28 20:27:29,315 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:27:29,315 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 107
[2024-02-28 20:27:29,318 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 53
[2024-02-28 20:27:29,322 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28
[2024-02-28 20:27:29,338 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,338 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,343 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:27:29,343 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 1
[2024-02-28 20:27:29,345 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,345 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,347 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,347 INFO  L173   IndexEqualityManager]: detected equality via solver
[2024-02-28 20:27:29,351 INFO  L349             Elim1Store]: treesize reduction 38, result has 2.6 percent of original size
[2024-02-28 20:27:29,351 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 1
[2024-02-28 20:27:30,214 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67
[2024-02-28 20:27:30,224 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30
[2024-02-28 20:27:30,335 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:27:30,336 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39
[2024-02-28 20:27:30,389 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:30,389 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061450729] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:27:30,389 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:27:30,389 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 23, 18] total 52
[2024-02-28 20:27:30,389 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362601314]
[2024-02-28 20:27:30,389 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:27:30,390 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2024-02-28 20:27:30,390 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:27:30,390 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-02-28 20:27:30,391 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1927, Unknown=28, NotChecked=570, Total=2756
[2024-02-28 20:27:30,396 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 198
[2024-02-28 20:27:30,400 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 591 transitions, 5869 flow. Second operand  has 53 states, 53 states have (on average 103.86792452830188) internal successors, (5505), 53 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:30,400 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:27:30,400 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 198
[2024-02-28 20:27:30,400 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:27:44,042 INFO  L124   PetriNetUnfolderBase]: 3633/14627 cut-off events.
[2024-02-28 20:27:44,042 INFO  L125   PetriNetUnfolderBase]: For 64281/64357 co-relation queries the response was YES.
[2024-02-28 20:27:44,126 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 49244 conditions, 14627 events. 3633/14627 cut-off events. For 64281/64357 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 168632 event pairs, 317 based on Foata normal form. 66/14077 useless extension candidates. Maximal degree in co-relation 48920. Up to 1540 conditions per place. 
[2024-02-28 20:27:44,152 INFO  L140   encePairwiseOnDemand]: 161/198 looper letters, 889 selfloop transitions, 277 changer transitions 329/1617 dead transitions.
[2024-02-28 20:27:44,152 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1617 transitions, 17789 flow
[2024-02-28 20:27:44,152 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. 
[2024-02-28 20:27:44,153 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2024-02-28 20:27:44,157 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 8936 transitions.
[2024-02-28 20:27:44,159 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5571767053248535
[2024-02-28 20:27:44,159 INFO  L72            ComplementDD]: Start complementDD. Operand 81 states and 8936 transitions.
[2024-02-28 20:27:44,159 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 81 states and 8936 transitions.
[2024-02-28 20:27:44,161 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:27:44,161 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 81 states and 8936 transitions.
[2024-02-28 20:27:44,168 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 82 states, 81 states have (on average 110.32098765432099) internal successors, (8936), 81 states have internal predecessors, (8936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:44,179 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 82 states, 82 states have (on average 198.0) internal successors, (16236), 82 states have internal predecessors, (16236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:44,180 INFO  L81            ComplementDD]: Finished complementDD. Result  has 82 states, 82 states have (on average 198.0) internal successors, (16236), 82 states have internal predecessors, (16236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:44,180 INFO  L175             Difference]: Start difference. First operand has 365 places, 591 transitions, 5869 flow. Second operand 81 states and 8936 transitions.
[2024-02-28 20:27:44,180 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 1617 transitions, 17789 flow
[2024-02-28 20:27:44,615 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 1617 transitions, 17247 flow, removed 109 selfloop flow, removed 20 redundant places.
[2024-02-28 20:27:44,628 INFO  L231             Difference]: Finished difference. Result has 446 places, 667 transitions, 7380 flow
[2024-02-28 20:27:44,628 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=5662, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=591, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=178, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=388, PETRI_DIFFERENCE_SUBTRAHEND_STATES=81, PETRI_FLOW=7380, PETRI_PLACES=446, PETRI_TRANSITIONS=667}
[2024-02-28 20:27:44,628 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 256 predicate places.
[2024-02-28 20:27:44,628 INFO  L495      AbstractCegarLoop]: Abstraction has has 446 places, 667 transitions, 7380 flow
[2024-02-28 20:27:44,629 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 53 states, 53 states have (on average 103.86792452830188) internal successors, (5505), 53 states have internal predecessors, (5505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:27:44,629 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:27:44,629 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:27:44,636 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0
[2024-02-28 20:27:44,834 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:44,835 INFO  L420      AbstractCegarLoop]: === Iteration 21 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:27:44,836 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:27:44,836 INFO  L85        PathProgramCache]: Analyzing trace with hash 754201270, now seen corresponding path program 5 times
[2024-02-28 20:27:44,836 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:27:44,836 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822530868]
[2024-02-28 20:27:44,836 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:27:44,837 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:27:44,857 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:27:45,417 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:45,417 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:27:45,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822530868]
[2024-02-28 20:27:45,417 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822530868] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:27:45,417 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1382493305]
[2024-02-28 20:27:45,417 INFO  L93    rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1
[2024-02-28 20:27:45,417 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:27:45,417 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:27:45,419 INFO  L229       MonitoredProcess]: Starting monitored process 7 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:27:45,419 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process
[2024-02-28 20:27:45,603 INFO  L228   tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:27:45,603 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:27:45,605 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 67 conjunts are in the unsatisfiable core
[2024-02-28 20:27:45,611 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:27:45,741 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:27:45,848 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:27:45,849 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:27:46,462 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:27:46,588 INFO  L349             Elim1Store]: treesize reduction 17, result has 22.7 percent of original size
[2024-02-28 20:27:46,589 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24
[2024-02-28 20:27:46,815 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:46,815 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:27:46,941 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:27:47,009 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:27:47,071 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:27:47,142 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:27:47,216 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:27:47,298 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:47,299 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:47,341 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:47,341 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:47,374 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:47,375 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:47,395 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:27:47,396 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:47,468 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:27:47,505 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:27:47,505 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:27:47,521 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* c_threadThread1of1ForFork0_~j~0 4))) (and (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset 3 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse0 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_956 (Array Int Int))) (= (select (select (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse0)) |c_threadThread1of1ForFork0_#t~nondet4|)))) is different from false
[2024-02-28 20:28:12,704 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse2 (+ c_~datas~0.offset 3 .cse1))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|)))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse1 1)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse1)))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) |c_ULTIMATE.start_main_#t~mem25#1.base| v_ArrVal_956) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-02-28 20:28:12,737 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (select |c_#race| c_~datas~0.base) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset 2 .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse3))))))) is different from false
[2024-02-28 20:28:12,766 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse4 (+ c_~datas~0.offset 2 .cse2)) (.cse3 (+ c_~datas~0.offset 3 .cse2))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse2)) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse4) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse2 1)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-02-28 20:28:12,790 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse5 (* c_threadThread1of1ForFork0_~j~0 4))) (let ((.cse4 (+ c_~datas~0.offset .cse5 1)) (.cse3 (+ c_~datas~0.offset 2 .cse5)) (.cse2 (+ c_~datas~0.offset 3 .cse5))) (let ((.cse0 (store |c_#race| c_~datas~0.base (store (store (store (select |c_#race| c_~datas~0.base) .cse4 |c_threadThread1of1ForFork0_#t~nondet4|) .cse3 |c_threadThread1of1ForFork0_#t~nondet4|) .cse2 |c_threadThread1of1ForFork0_#t~nondet4|))) (.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|))) (and (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse2) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse3) |c_threadThread1of1ForFork0_#t~nondet4|)) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= |c_threadThread1of1ForFork0_#t~nondet4| (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) .cse4))) (forall ((v_ArrVal_955 (Array Int Int)) (v_ArrVal_956 (Array Int Int))) (= (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#tids~0#1.base| v_ArrVal_955) .cse1 v_ArrVal_956) c_~datas~0.base) (+ c_~datas~0.offset .cse5)) |c_threadThread1of1ForFork0_#t~nondet4|)))))) is different from false
[2024-02-28 20:28:12,816 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:28:12,817 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 74
[2024-02-28 20:28:12,884 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:28:12,885 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 183 treesize of output 91
[2024-02-28 20:28:12,892 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35
[2024-02-28 20:28:12,895 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 46
[2024-02-28 20:28:12,922 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:28:12,922 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-02-28 20:28:12,929 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:28:12,930 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 1
[2024-02-28 20:28:12,941 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:28:12,942 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 1
[2024-02-28 20:28:14,141 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 67
[2024-02-28 20:28:14,150 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54
[2024-02-28 20:28:14,155 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-02-28 20:28:14,319 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:28:14,320 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 39
[2024-02-28 20:28:14,391 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:14,391 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1382493305] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:28:14,392 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:28:14,392 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 24, 17] total 52
[2024-02-28 20:28:14,392 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257632417]
[2024-02-28 20:28:14,392 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:28:14,393 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 53 states
[2024-02-28 20:28:14,394 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:14,394 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants.
[2024-02-28 20:28:14,395 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=2008, Unknown=34, NotChecked=480, Total=2756
[2024-02-28 20:28:14,730 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 101 out of 198
[2024-02-28 20:28:14,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 667 transitions, 7380 flow. Second operand  has 53 states, 53 states have (on average 103.83018867924528) internal successors, (5503), 53 states have internal predecessors, (5503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:14,736 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:14,736 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 198
[2024-02-28 20:28:14,736 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:38,276 INFO  L124   PetriNetUnfolderBase]: 3273/13209 cut-off events.
[2024-02-28 20:28:38,276 INFO  L125   PetriNetUnfolderBase]: For 77386/77483 co-relation queries the response was YES.
[2024-02-28 20:28:38,370 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 47518 conditions, 13209 events. 3273/13209 cut-off events. For 77386/77483 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 149179 event pairs, 264 based on Foata normal form. 98/12746 useless extension candidates. Maximal degree in co-relation 47162. Up to 1319 conditions per place. 
[2024-02-28 20:28:38,397 INFO  L140   encePairwiseOnDemand]: 163/198 looper letters, 881 selfloop transitions, 455 changer transitions 130/1588 dead transitions.
[2024-02-28 20:28:38,397 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 1588 transitions, 17304 flow
[2024-02-28 20:28:38,398 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. 
[2024-02-28 20:28:38,398 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 105 states.
[2024-02-28 20:28:38,404 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 11488 transitions.
[2024-02-28 20:28:38,407 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.5525733525733526
[2024-02-28 20:28:38,407 INFO  L72            ComplementDD]: Start complementDD. Operand 105 states and 11488 transitions.
[2024-02-28 20:28:38,407 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 105 states and 11488 transitions.
[2024-02-28 20:28:38,409 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:38,409 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 105 states and 11488 transitions.
[2024-02-28 20:28:38,419 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 106 states, 105 states have (on average 109.4095238095238) internal successors, (11488), 105 states have internal predecessors, (11488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:38,431 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 106 states, 106 states have (on average 198.0) internal successors, (20988), 106 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:38,433 INFO  L81            ComplementDD]: Finished complementDD. Result  has 106 states, 106 states have (on average 198.0) internal successors, (20988), 106 states have internal predecessors, (20988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:38,433 INFO  L175             Difference]: Start difference. First operand has 446 places, 667 transitions, 7380 flow. Second operand 105 states and 11488 transitions.
[2024-02-28 20:28:38,433 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 1588 transitions, 17304 flow
[2024-02-28 20:28:38,915 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 505 places, 1588 transitions, 16368 flow, removed 238 selfloop flow, removed 42 redundant places.
[2024-02-28 20:28:38,930 INFO  L231             Difference]: Finished difference. Result has 512 places, 787 transitions, 9470 flow
[2024-02-28 20:28:38,930 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=6653, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=336, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=105, PETRI_FLOW=9470, PETRI_PLACES=512, PETRI_TRANSITIONS=787}
[2024-02-28 20:28:38,931 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 322 predicate places.
[2024-02-28 20:28:38,931 INFO  L495      AbstractCegarLoop]: Abstraction has has 512 places, 787 transitions, 9470 flow
[2024-02-28 20:28:38,931 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 53 states, 53 states have (on average 103.83018867924528) internal successors, (5503), 53 states have internal predecessors, (5503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:38,931 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:38,932 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:38,938 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0
[2024-02-28 20:28:39,132 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:39,133 INFO  L420      AbstractCegarLoop]: === Iteration 22 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:39,133 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:39,134 INFO  L85        PathProgramCache]: Analyzing trace with hash -681919608, now seen corresponding path program 1 times
[2024-02-28 20:28:39,134 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:39,134 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755758149]
[2024-02-28 20:28:39,134 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:39,135 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:39,161 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:40,101 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:40,101 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:40,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755758149]
[2024-02-28 20:28:40,102 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755758149] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:28:40,102 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165880331]
[2024-02-28 20:28:40,102 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:40,102 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:40,102 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:28:40,104 INFO  L229       MonitoredProcess]: Starting monitored process 8 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:28:40,105 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process
[2024-02-28 20:28:40,263 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:40,264 INFO  L262         TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 42 conjunts are in the unsatisfiable core
[2024-02-28 20:28:40,269 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:28:40,275 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:28:40,301 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:28:40,302 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:28:40,412 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:40,422 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:28:40,423 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18
[2024-02-28 20:28:40,872 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:28:40,872 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-02-28 20:28:40,956 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:40,957 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18
[2024-02-28 20:28:41,041 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:28:41,089 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:28:41,155 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:28:41,238 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:28:41,239 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:28:41,317 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:28:41,317 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:28:41,402 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:41,407 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:28:41,454 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:41,455 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:28:41,508 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:41,509 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:28:41,543 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:28:41,543 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:28:41,602 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:28:41,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:28:41,618 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:28:41,618 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [165880331] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:41,618 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:28:41,618 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 25
[2024-02-28 20:28:41,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384358849]
[2024-02-28 20:28:41,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:41,619 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:28:41,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:41,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:28:41,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650
[2024-02-28 20:28:43,283 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 143 out of 198
[2024-02-28 20:28:43,285 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 512 places, 787 transitions, 9470 flow. Second operand  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:43,285 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:43,285 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 198
[2024-02-28 20:28:43,285 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:47,130 INFO  L124   PetriNetUnfolderBase]: 2272/10823 cut-off events.
[2024-02-28 20:28:47,131 INFO  L125   PetriNetUnfolderBase]: For 62806/62992 co-relation queries the response was YES.
[2024-02-28 20:28:47,204 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37641 conditions, 10823 events. 2272/10823 cut-off events. For 62806/62992 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 122572 event pairs, 373 based on Foata normal form. 68/10335 useless extension candidates. Maximal degree in co-relation 37526. Up to 1077 conditions per place. 
[2024-02-28 20:28:47,225 INFO  L140   encePairwiseOnDemand]: 178/198 looper letters, 225 selfloop transitions, 190 changer transitions 277/915 dead transitions.
[2024-02-28 20:28:47,225 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 915 transitions, 11943 flow
[2024-02-28 20:28:47,226 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. 
[2024-02-28 20:28:47,226 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 23 states.
[2024-02-28 20:28:47,227 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 3455 transitions.
[2024-02-28 20:28:47,228 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7586736934563022
[2024-02-28 20:28:47,228 INFO  L72            ComplementDD]: Start complementDD. Operand 23 states and 3455 transitions.
[2024-02-28 20:28:47,229 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 23 states and 3455 transitions.
[2024-02-28 20:28:47,229 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:47,229 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 3455 transitions.
[2024-02-28 20:28:47,232 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 24 states, 23 states have (on average 150.2173913043478) internal successors, (3455), 23 states have internal predecessors, (3455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:47,235 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 24 states, 24 states have (on average 198.0) internal successors, (4752), 24 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:47,235 INFO  L81            ComplementDD]: Finished complementDD. Result  has 24 states, 24 states have (on average 198.0) internal successors, (4752), 24 states have internal predecessors, (4752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:47,235 INFO  L175             Difference]: Start difference. First operand has 512 places, 787 transitions, 9470 flow. Second operand 23 states and 3455 transitions.
[2024-02-28 20:28:47,235 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 915 transitions, 11943 flow
[2024-02-28 20:28:47,642 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 476 places, 915 transitions, 10739 flow, removed 228 selfloop flow, removed 56 redundant places.
[2024-02-28 20:28:47,651 INFO  L231             Difference]: Finished difference. Result has 479 places, 594 transitions, 5448 flow
[2024-02-28 20:28:47,651 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=8374, PETRI_DIFFERENCE_MINUEND_PLACES=454, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=787, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=190, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=597, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5448, PETRI_PLACES=479, PETRI_TRANSITIONS=594}
[2024-02-28 20:28:47,651 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 289 predicate places.
[2024-02-28 20:28:47,652 INFO  L495      AbstractCegarLoop]: Abstraction has has 479 places, 594 transitions, 5448 flow
[2024-02-28 20:28:47,652 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 145.2) internal successors, (2178), 15 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:47,652 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:47,652 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:47,658 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0
[2024-02-28 20:28:47,853 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21
[2024-02-28 20:28:47,854 INFO  L420      AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:47,854 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:47,854 INFO  L85        PathProgramCache]: Analyzing trace with hash 1015290480, now seen corresponding path program 1 times
[2024-02-28 20:28:47,855 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:47,855 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851550332]
[2024-02-28 20:28:47,855 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:47,855 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:47,879 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:47,923 INFO  L134       CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked.
[2024-02-28 20:28:47,923 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:47,923 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851550332]
[2024-02-28 20:28:47,923 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851550332] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:47,924 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:47,924 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-02-28 20:28:47,924 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110853769]
[2024-02-28 20:28:47,924 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:47,924 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:28:47,924 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:47,924 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:28:47,925 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:28:47,937 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 187 out of 198
[2024-02-28 20:28:47,937 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 479 places, 594 transitions, 5448 flow. Second operand  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:47,937 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:47,937 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 198
[2024-02-28 20:28:47,938 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:48,621 INFO  L124   PetriNetUnfolderBase]: 704/4463 cut-off events.
[2024-02-28 20:28:48,621 INFO  L125   PetriNetUnfolderBase]: For 18115/18186 co-relation queries the response was YES.
[2024-02-28 20:28:48,644 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 13297 conditions, 4463 events. 704/4463 cut-off events. For 18115/18186 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 42750 event pairs, 45 based on Foata normal form. 12/4326 useless extension candidates. Maximal degree in co-relation 13198. Up to 432 conditions per place. 
[2024-02-28 20:28:48,650 INFO  L140   encePairwiseOnDemand]: 194/198 looper letters, 3 selfloop transitions, 4 changer transitions 0/569 dead transitions.
[2024-02-28 20:28:48,650 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 569 transitions, 5328 flow
[2024-02-28 20:28:48,651 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:28:48,651 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:28:48,651 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 569 transitions.
[2024-02-28 20:28:48,652 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9579124579124579
[2024-02-28 20:28:48,652 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 569 transitions.
[2024-02-28 20:28:48,652 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 569 transitions.
[2024-02-28 20:28:48,652 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:48,652 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 569 transitions.
[2024-02-28 20:28:48,652 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 189.66666666666666) internal successors, (569), 3 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:48,653 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:48,653 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 198.0) internal successors, (792), 4 states have internal predecessors, (792), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:48,653 INFO  L175             Difference]: Start difference. First operand has 479 places, 594 transitions, 5448 flow. Second operand 3 states and 569 transitions.
[2024-02-28 20:28:48,653 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 569 transitions, 5328 flow
[2024-02-28 20:28:48,723 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 569 transitions, 4583 flow, removed 93 selfloop flow, removed 63 redundant places.
[2024-02-28 20:28:48,728 INFO  L231             Difference]: Finished difference. Result has 384 places, 569 transitions, 4577 flow
[2024-02-28 20:28:48,729 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=4569, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=569, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4577, PETRI_PLACES=384, PETRI_TRANSITIONS=569}
[2024-02-28 20:28:48,729 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 194 predicate places.
[2024-02-28 20:28:48,729 INFO  L495      AbstractCegarLoop]: Abstraction has has 384 places, 569 transitions, 4577 flow
[2024-02-28 20:28:48,729 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:48,729 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:48,730 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:48,730 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22
[2024-02-28 20:28:48,730 INFO  L420      AbstractCegarLoop]: === Iteration 24 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:48,730 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:48,730 INFO  L85        PathProgramCache]: Analyzing trace with hash 1395076546, now seen corresponding path program 1 times
[2024-02-28 20:28:48,730 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:48,730 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288019230]
[2024-02-28 20:28:48,730 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:48,730 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:48,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:48,820 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:48,820 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:48,820 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288019230]
[2024-02-28 20:28:48,821 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288019230] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:28:48,821 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387794659]
[2024-02-28 20:28:48,821 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:48,821 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:48,821 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:28:48,823 INFO  L229       MonitoredProcess]: Starting monitored process 9 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:28:48,824 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process
[2024-02-28 20:28:48,960 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:48,961 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjunts are in the unsatisfiable core
[2024-02-28 20:28:48,964 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:28:49,067 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:49,067 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:28:49,167 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:49,167 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [387794659] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:28:49,168 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:28:49,168 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9
[2024-02-28 20:28:49,168 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569957014]
[2024-02-28 20:28:49,168 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:28:49,168 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 9 states
[2024-02-28 20:28:49,169 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:49,169 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2024-02-28 20:28:49,169 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72
[2024-02-28 20:28:49,318 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 175 out of 198
[2024-02-28 20:28:49,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 569 transitions, 4577 flow. Second operand  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:49,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:49,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 198
[2024-02-28 20:28:49,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:49,840 INFO  L124   PetriNetUnfolderBase]: 540/3302 cut-off events.
[2024-02-28 20:28:49,840 INFO  L125   PetriNetUnfolderBase]: For 7277/7315 co-relation queries the response was YES.
[2024-02-28 20:28:49,852 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 8363 conditions, 3302 events. 540/3302 cut-off events. For 7277/7315 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 28837 event pairs, 30 based on Foata normal form. 5/3200 useless extension candidates. Maximal degree in co-relation 8163. Up to 252 conditions per place. 
[2024-02-28 20:28:49,856 INFO  L140   encePairwiseOnDemand]: 191/198 looper letters, 16 selfloop transitions, 34 changer transitions 2/480 dead transitions.
[2024-02-28 20:28:49,856 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 480 transitions, 3874 flow
[2024-02-28 20:28:49,857 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2024-02-28 20:28:49,857 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2024-02-28 20:28:49,858 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1249 transitions.
[2024-02-28 20:28:49,858 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9011544011544012
[2024-02-28 20:28:49,858 INFO  L72            ComplementDD]: Start complementDD. Operand 7 states and 1249 transitions.
[2024-02-28 20:28:49,859 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 7 states and 1249 transitions.
[2024-02-28 20:28:49,859 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:49,859 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1249 transitions.
[2024-02-28 20:28:49,860 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 8 states, 7 states have (on average 178.42857142857142) internal successors, (1249), 7 states have internal predecessors, (1249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:49,861 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:49,861 INFO  L81            ComplementDD]: Finished complementDD. Result  has 8 states, 8 states have (on average 198.0) internal successors, (1584), 8 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:49,861 INFO  L175             Difference]: Start difference. First operand has 384 places, 569 transitions, 4577 flow. Second operand 7 states and 1249 transitions.
[2024-02-28 20:28:49,861 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 480 transitions, 3874 flow
[2024-02-28 20:28:49,895 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 480 transitions, 3297 flow, removed 12 selfloop flow, removed 13 redundant places.
[2024-02-28 20:28:49,899 INFO  L231             Difference]: Finished difference. Result has 348 places, 472 transitions, 3241 flow
[2024-02-28 20:28:49,900 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3167, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=471, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3241, PETRI_PLACES=348, PETRI_TRANSITIONS=472}
[2024-02-28 20:28:49,900 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 158 predicate places.
[2024-02-28 20:28:49,900 INFO  L495      AbstractCegarLoop]: Abstraction has has 348 places, 472 transitions, 3241 flow
[2024-02-28 20:28:49,901 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 9 states, 9 states have (on average 177.55555555555554) internal successors, (1598), 9 states have internal predecessors, (1598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:49,901 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:49,901 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:49,910 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0
[2024-02-28 20:28:50,101 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23
[2024-02-28 20:28:50,103 INFO  L420      AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:50,104 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:50,104 INFO  L85        PathProgramCache]: Analyzing trace with hash -2085568261, now seen corresponding path program 1 times
[2024-02-28 20:28:50,104 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:50,105 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743515173]
[2024-02-28 20:28:50,105 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:50,105 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:50,135 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:50,260 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-02-28 20:28:50,261 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:50,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743515173]
[2024-02-28 20:28:50,261 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743515173] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:28:50,261 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679780414]
[2024-02-28 20:28:50,262 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:50,262 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:50,262 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:28:50,263 INFO  L229       MonitoredProcess]: Starting monitored process 10 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:28:50,264 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process
[2024-02-28 20:28:50,416 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:50,418 INFO  L262         TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 6 conjunts are in the unsatisfiable core
[2024-02-28 20:28:50,420 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:28:50,604 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:50,605 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:28:50,605 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679780414] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:50,605 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:28:50,605 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 10
[2024-02-28 20:28:50,605 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846917484]
[2024-02-28 20:28:50,605 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:50,606 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-02-28 20:28:50,606 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:50,606 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-02-28 20:28:50,607 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:28:50,734 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 172 out of 198
[2024-02-28 20:28:50,735 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 472 transitions, 3241 flow. Second operand  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:50,735 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:50,735 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 198
[2024-02-28 20:28:50,735 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:51,279 INFO  L124   PetriNetUnfolderBase]: 491/3192 cut-off events.
[2024-02-28 20:28:51,280 INFO  L125   PetriNetUnfolderBase]: For 5277/5312 co-relation queries the response was YES.
[2024-02-28 20:28:51,294 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7593 conditions, 3192 events. 491/3192 cut-off events. For 5277/5312 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 27749 event pairs, 29 based on Foata normal form. 25/3118 useless extension candidates. Maximal degree in co-relation 6283. Up to 252 conditions per place. 
[2024-02-28 20:28:51,299 INFO  L140   encePairwiseOnDemand]: 187/198 looper letters, 32 selfloop transitions, 16 changer transitions 1/495 dead transitions.
[2024-02-28 20:28:51,300 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 495 transitions, 3402 flow
[2024-02-28 20:28:51,300 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 20:28:51,300 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 20:28:51,301 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1940 transitions.
[2024-02-28 20:28:51,302 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8907254361799817
[2024-02-28 20:28:51,302 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 1940 transitions.
[2024-02-28 20:28:51,302 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 1940 transitions.
[2024-02-28 20:28:51,302 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:51,302 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1940 transitions.
[2024-02-28 20:28:51,304 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 176.36363636363637) internal successors, (1940), 11 states have internal predecessors, (1940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:51,305 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:51,305 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 198.0) internal successors, (2376), 12 states have internal predecessors, (2376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:51,306 INFO  L175             Difference]: Start difference. First operand has 348 places, 472 transitions, 3241 flow. Second operand 11 states and 1940 transitions.
[2024-02-28 20:28:51,306 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 495 transitions, 3402 flow
[2024-02-28 20:28:51,333 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 495 transitions, 3370 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:28:51,338 INFO  L231             Difference]: Finished difference. Result has 360 places, 481 transitions, 3293 flow
[2024-02-28 20:28:51,338 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3209, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=472, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=459, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3293, PETRI_PLACES=360, PETRI_TRANSITIONS=481}
[2024-02-28 20:28:51,339 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 170 predicate places.
[2024-02-28 20:28:51,339 INFO  L495      AbstractCegarLoop]: Abstraction has has 360 places, 481 transitions, 3293 flow
[2024-02-28 20:28:51,339 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 7 states have (on average 174.85714285714286) internal successors, (1224), 7 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:51,340 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:51,340 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:51,348 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0
[2024-02-28 20:28:51,540 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:51,541 INFO  L420      AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:51,542 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:51,542 INFO  L85        PathProgramCache]: Analyzing trace with hash -1994841522, now seen corresponding path program 1 times
[2024-02-28 20:28:51,542 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:51,543 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529702939]
[2024-02-28 20:28:51,543 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:51,543 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:51,575 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:51,680 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:51,680 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:51,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529702939]
[2024-02-28 20:28:51,681 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529702939] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:28:51,681 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837793569]
[2024-02-28 20:28:51,681 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:51,682 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:28:51,682 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:28:51,684 INFO  L229       MonitoredProcess]: Starting monitored process 11 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:28:51,686 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process
[2024-02-28 20:28:51,839 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:51,840 INFO  L262         TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 7 conjunts are in the unsatisfiable core
[2024-02-28 20:28:51,841 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:28:52,052 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:52,052 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:28:52,291 INFO  L134       CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:52,291 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837793569] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:28:52,291 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:28:52,291 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11
[2024-02-28 20:28:52,292 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614133725]
[2024-02-28 20:28:52,292 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:28:52,292 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 11 states
[2024-02-28 20:28:52,293 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:52,293 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants.
[2024-02-28 20:28:52,293 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-02-28 20:28:52,559 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 174 out of 198
[2024-02-28 20:28:52,561 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 481 transitions, 3293 flow. Second operand  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:52,561 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:52,561 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 198
[2024-02-28 20:28:52,561 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:53,146 INFO  L124   PetriNetUnfolderBase]: 558/3633 cut-off events.
[2024-02-28 20:28:53,147 INFO  L125   PetriNetUnfolderBase]: For 6396/6432 co-relation queries the response was YES.
[2024-02-28 20:28:53,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 9067 conditions, 3633 events. 558/3633 cut-off events. For 6396/6432 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 33164 event pairs, 32 based on Foata normal form. 12/3534 useless extension candidates. Maximal degree in co-relation 7505. Up to 312 conditions per place. 
[2024-02-28 20:28:53,171 INFO  L140   encePairwiseOnDemand]: 188/198 looper letters, 36 selfloop transitions, 15 changer transitions 0/502 dead transitions.
[2024-02-28 20:28:53,171 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 502 transitions, 3482 flow
[2024-02-28 20:28:53,172 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 20:28:53,172 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 20:28:53,172 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1783 transitions.
[2024-02-28 20:28:53,173 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9005050505050505
[2024-02-28 20:28:53,173 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 1783 transitions.
[2024-02-28 20:28:53,173 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 1783 transitions.
[2024-02-28 20:28:53,174 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:53,174 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1783 transitions.
[2024-02-28 20:28:53,175 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 178.3) internal successors, (1783), 10 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,176 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,177 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 198.0) internal successors, (2178), 11 states have internal predecessors, (2178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,177 INFO  L175             Difference]: Start difference. First operand has 360 places, 481 transitions, 3293 flow. Second operand 10 states and 1783 transitions.
[2024-02-28 20:28:53,177 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 502 transitions, 3482 flow
[2024-02-28 20:28:53,207 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 502 transitions, 3468 flow, removed 4 selfloop flow, removed 2 redundant places.
[2024-02-28 20:28:53,212 INFO  L231             Difference]: Finished difference. Result has 370 places, 491 transitions, 3390 flow
[2024-02-28 20:28:53,212 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=198, PETRI_DIFFERENCE_MINUEND_FLOW=3283, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=3390, PETRI_PLACES=370, PETRI_TRANSITIONS=491}
[2024-02-28 20:28:53,213 INFO  L281   CegarLoopForPetriNet]: 190 programPoint places, 180 predicate places.
[2024-02-28 20:28:53,213 INFO  L495      AbstractCegarLoop]: Abstraction has has 370 places, 491 transitions, 3390 flow
[2024-02-28 20:28:53,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 11 states, 11 states have (on average 176.45454545454547) internal successors, (1941), 11 states have internal predecessors, (1941), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,214 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:53,214 INFO  L208   CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:53,221 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0
[2024-02-28 20:28:53,414 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25
[2024-02-28 20:28:53,415 INFO  L420      AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 15 more)] ===
[2024-02-28 20:28:53,415 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:53,416 INFO  L85        PathProgramCache]: Analyzing trace with hash 1065958024, now seen corresponding path program 1 times
[2024-02-28 20:28:53,416 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:53,416 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814013581]
[2024-02-28 20:28:53,417 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:53,417 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:53,448 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:28:53,448 INFO  L356             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-02-28 20:28:53,461 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-02-28 20:28:53,491 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-02-28 20:28:53,491 INFO  L360         BasicCegarLoop]: Counterexample is feasible
[2024-02-28 20:28:53,492 INFO  L805   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 18 remaining)
[2024-02-28 20:28:53,494 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 18 remaining)
[2024-02-28 20:28:53,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 18 remaining)
[2024-02-28 20:28:53,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 18 remaining)
[2024-02-28 20:28:53,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 18 remaining)
[2024-02-28 20:28:53,495 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (12 of 18 remaining)
[2024-02-28 20:28:53,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (11 of 18 remaining)
[2024-02-28 20:28:53,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (10 of 18 remaining)
[2024-02-28 20:28:53,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 18 remaining)
[2024-02-28 20:28:53,496 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 18 remaining)
[2024-02-28 20:28:53,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 18 remaining)
[2024-02-28 20:28:53,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 18 remaining)
[2024-02-28 20:28:53,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 18 remaining)
[2024-02-28 20:28:53,497 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 18 remaining)
[2024-02-28 20:28:53,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 18 remaining)
[2024-02-28 20:28:53,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 18 remaining)
[2024-02-28 20:28:53,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 18 remaining)
[2024-02-28 20:28:53,498 INFO  L805   garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 18 remaining)
[2024-02-28 20:28:53,499 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26
[2024-02-28 20:28:53,499 INFO  L445         BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:53,500 WARN  L233   ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis
[2024-02-28 20:28:53,501 INFO  L514   ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances.
[2024-02-28 20:28:53,544 INFO  L144    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2024-02-28 20:28:53,546 INFO  L73            FinitePrefix]: Start finitePrefix. Operand has 239 places, 249 transitions, 514 flow
[2024-02-28 20:28:53,591 INFO  L124   PetriNetUnfolderBase]: 27/482 cut-off events.
[2024-02-28 20:28:53,592 INFO  L125   PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES.
[2024-02-28 20:28:53,593 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 494 conditions, 482 events. 27/482 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1195 event pairs, 0 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 289. Up to 9 conditions per place. 
[2024-02-28 20:28:53,593 INFO  L82        GeneralOperation]: Start removeDead. Operand has 239 places, 249 transitions, 514 flow
[2024-02-28 20:28:53,595 INFO  L88        GeneralOperation]: Finished RemoveDead, result has has 239 places, 249 transitions, 514 flow
[2024-02-28 20:28:53,596 INFO  L356      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-02-28 20:28:53,596 INFO  L357      AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@785837cc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-02-28 20:28:53,596 INFO  L358      AbstractCegarLoop]: Starting to check reachability of 22 error locations.
[2024-02-28 20:28:53,599 INFO  L185   PetriNetUnfolderBase]: Found word, exiting Unfolder.
[2024-02-28 20:28:53,599 INFO  L124   PetriNetUnfolderBase]: 2/41 cut-off events.
[2024-02-28 20:28:53,599 INFO  L125   PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES.
[2024-02-28 20:28:53,599 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:53,599 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:53,599 INFO  L420      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:28:53,599 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:53,599 INFO  L85        PathProgramCache]: Analyzing trace with hash -1170001773, now seen corresponding path program 1 times
[2024-02-28 20:28:53,600 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:53,600 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822606811]
[2024-02-28 20:28:53,600 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:53,600 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:53,606 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:53,616 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:53,616 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:53,617 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822606811]
[2024-02-28 20:28:53,617 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822606811] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:53,617 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:53,617 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:28:53,618 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329987929]
[2024-02-28 20:28:53,618 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:53,618 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:28:53,619 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:53,619 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:28:53,620 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:28:53,650 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-02-28 20:28:53,651 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 249 transitions, 514 flow. Second operand  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,651 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:53,651 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-02-28 20:28:53,651 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:53,875 INFO  L124   PetriNetUnfolderBase]: 237/2093 cut-off events.
[2024-02-28 20:28:53,876 INFO  L125   PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES.
[2024-02-28 20:28:53,882 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 2380 conditions, 2093 events. 237/2093 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 14857 event pairs, 132 based on Foata normal form. 41/1821 useless extension candidates. Maximal degree in co-relation 1763. Up to 258 conditions per place. 
[2024-02-28 20:28:53,887 INFO  L140   encePairwiseOnDemand]: 242/249 looper letters, 17 selfloop transitions, 2 changer transitions 2/244 dead transitions.
[2024-02-28 20:28:53,887 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 244 transitions, 542 flow
[2024-02-28 20:28:53,887 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:28:53,887 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:28:53,888 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 699 transitions.
[2024-02-28 20:28:53,888 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9357429718875502
[2024-02-28 20:28:53,888 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 699 transitions.
[2024-02-28 20:28:53,888 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 699 transitions.
[2024-02-28 20:28:53,889 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:53,889 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 699 transitions.
[2024-02-28 20:28:53,889 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.0) internal successors, (699), 3 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,890 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,890 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,890 INFO  L175             Difference]: Start difference. First operand has 239 places, 249 transitions, 514 flow. Second operand 3 states and 699 transitions.
[2024-02-28 20:28:53,890 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 244 transitions, 542 flow
[2024-02-28 20:28:53,891 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 244 transitions, 542 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:28:53,893 INFO  L231             Difference]: Finished difference. Result has 240 places, 242 transitions, 504 flow
[2024-02-28 20:28:53,893 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=240, PETRI_TRANSITIONS=242}
[2024-02-28 20:28:53,894 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-02-28 20:28:53,894 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 242 transitions, 504 flow
[2024-02-28 20:28:53,894 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,894 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:53,894 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:53,894 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27
[2024-02-28 20:28:53,895 INFO  L420      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:28:53,895 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:53,895 INFO  L85        PathProgramCache]: Analyzing trace with hash 1890323478, now seen corresponding path program 1 times
[2024-02-28 20:28:53,895 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:53,895 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673195459]
[2024-02-28 20:28:53,895 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:53,896 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:53,901 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:53,911 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:53,911 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:53,911 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673195459]
[2024-02-28 20:28:53,912 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673195459] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:53,912 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:53,912 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:28:53,912 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524669291]
[2024-02-28 20:28:53,912 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:53,912 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:28:53,912 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:53,913 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:28:53,913 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:28:53,940 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 220 out of 249
[2024-02-28 20:28:53,941 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 242 transitions, 504 flow. Second operand  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:53,941 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:53,941 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 220 of 249
[2024-02-28 20:28:53,941 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:54,577 INFO  L124   PetriNetUnfolderBase]: 1364/6164 cut-off events.
[2024-02-28 20:28:54,577 INFO  L125   PetriNetUnfolderBase]: For 119/131 co-relation queries the response was YES.
[2024-02-28 20:28:54,589 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7813 conditions, 6164 events. 1364/6164 cut-off events. For 119/131 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 58942 event pairs, 374 based on Foata normal form. 1/5216 useless extension candidates. Maximal degree in co-relation 7766. Up to 850 conditions per place. 
[2024-02-28 20:28:54,600 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 34 selfloop transitions, 11 changer transitions 0/262 dead transitions.
[2024-02-28 20:28:54,600 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 262 transitions, 645 flow
[2024-02-28 20:28:54,601 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:28:54,601 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:28:54,602 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions.
[2024-02-28 20:28:54,603 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9491298527443106
[2024-02-28 20:28:54,603 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 709 transitions.
[2024-02-28 20:28:54,604 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 709 transitions.
[2024-02-28 20:28:54,604 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:54,604 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 709 transitions.
[2024-02-28 20:28:54,608 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 236.33333333333334) internal successors, (709), 3 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:54,609 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:54,609 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:54,609 INFO  L175             Difference]: Start difference. First operand has 240 places, 242 transitions, 504 flow. Second operand 3 states and 709 transitions.
[2024-02-28 20:28:54,609 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 262 transitions, 645 flow
[2024-02-28 20:28:54,610 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 262 transitions, 641 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:28:54,612 INFO  L231             Difference]: Finished difference. Result has 240 places, 253 transitions, 596 flow
[2024-02-28 20:28:54,612 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=240, PETRI_TRANSITIONS=253}
[2024-02-28 20:28:54,613 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 1 predicate places.
[2024-02-28 20:28:54,617 INFO  L495      AbstractCegarLoop]: Abstraction has has 240 places, 253 transitions, 596 flow
[2024-02-28 20:28:54,617 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:54,617 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:54,617 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:54,617 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28
[2024-02-28 20:28:54,617 INFO  L420      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:28:54,617 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:54,618 INFO  L85        PathProgramCache]: Analyzing trace with hash 1148099957, now seen corresponding path program 1 times
[2024-02-28 20:28:54,618 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:54,618 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928192374]
[2024-02-28 20:28:54,618 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:54,618 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:54,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:54,673 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:54,674 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:54,674 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928192374]
[2024-02-28 20:28:54,674 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928192374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:54,674 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:54,674 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:28:54,675 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167855631]
[2024-02-28 20:28:54,675 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:54,675 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-02-28 20:28:54,675 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:54,676 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-02-28 20:28:54,676 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2024-02-28 20:28:54,789 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-02-28 20:28:54,790 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 253 transitions, 596 flow. Second operand  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:54,790 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:54,790 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-02-28 20:28:54,790 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:55,380 INFO  L124   PetriNetUnfolderBase]: 864/5441 cut-off events.
[2024-02-28 20:28:55,380 INFO  L125   PetriNetUnfolderBase]: For 273/281 co-relation queries the response was YES.
[2024-02-28 20:28:55,398 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 7046 conditions, 5441 events. 864/5441 cut-off events. For 273/281 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 53308 event pairs, 269 based on Foata normal form. 1/4677 useless extension candidates. Maximal degree in co-relation 3901. Up to 569 conditions per place. 
[2024-02-28 20:28:55,411 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 24 selfloop transitions, 6 changer transitions 1/263 dead transitions.
[2024-02-28 20:28:55,411 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 263 transitions, 678 flow
[2024-02-28 20:28:55,412 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:28:55,412 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:28:55,412 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1376 transitions.
[2024-02-28 20:28:55,413 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9210174029451138
[2024-02-28 20:28:55,413 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1376 transitions.
[2024-02-28 20:28:55,413 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1376 transitions.
[2024-02-28 20:28:55,413 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:55,413 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1376 transitions.
[2024-02-28 20:28:55,414 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 229.33333333333334) internal successors, (1376), 6 states have internal predecessors, (1376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:55,415 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:55,415 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:55,415 INFO  L175             Difference]: Start difference. First operand has 240 places, 253 transitions, 596 flow. Second operand 6 states and 1376 transitions.
[2024-02-28 20:28:55,415 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 263 transitions, 678 flow
[2024-02-28 20:28:55,418 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 263 transitions, 656 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:28:55,420 INFO  L231             Difference]: Finished difference. Result has 247 places, 258 transitions, 620 flow
[2024-02-28 20:28:55,420 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=247, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=620, PETRI_PLACES=247, PETRI_TRANSITIONS=258}
[2024-02-28 20:28:55,421 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 8 predicate places.
[2024-02-28 20:28:55,421 INFO  L495      AbstractCegarLoop]: Abstraction has has 247 places, 258 transitions, 620 flow
[2024-02-28 20:28:55,421 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 5 states, 5 states have (on average 225.4) internal successors, (1127), 5 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:55,424 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:55,425 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:55,425 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29
[2024-02-28 20:28:55,425 INFO  L420      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:28:55,425 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:55,425 INFO  L85        PathProgramCache]: Analyzing trace with hash 1910051291, now seen corresponding path program 1 times
[2024-02-28 20:28:55,425 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:55,425 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792991684]
[2024-02-28 20:28:55,425 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:55,426 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:55,434 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:55,577 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:55,578 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:55,578 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792991684]
[2024-02-28 20:28:55,578 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792991684] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:55,578 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:55,578 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:28:55,578 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158345978]
[2024-02-28 20:28:55,578 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:55,579 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:28:55,579 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:55,579 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:28:55,580 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:28:55,833 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 205 out of 249
[2024-02-28 20:28:55,834 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 258 transitions, 620 flow. Second operand  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:55,834 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:55,834 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 249
[2024-02-28 20:28:55,834 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:58,825 INFO  L124   PetriNetUnfolderBase]: 6503/26023 cut-off events.
[2024-02-28 20:28:58,826 INFO  L125   PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES.
[2024-02-28 20:28:58,879 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 36352 conditions, 26023 events. 6503/26023 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 323808 event pairs, 1207 based on Foata normal form. 0/22666 useless extension candidates. Maximal degree in co-relation 36195. Up to 5287 conditions per place. 
[2024-02-28 20:28:58,936 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 70 selfloop transitions, 48 changer transitions 0/336 dead transitions.
[2024-02-28 20:28:58,936 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 252 places, 336 transitions, 1023 flow
[2024-02-28 20:28:58,937 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:28:58,937 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:28:58,938 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1351 transitions.
[2024-02-28 20:28:58,938 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9042838018741634
[2024-02-28 20:28:58,938 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1351 transitions.
[2024-02-28 20:28:58,938 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1351 transitions.
[2024-02-28 20:28:58,938 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:28:58,938 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1351 transitions.
[2024-02-28 20:28:58,940 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 225.16666666666666) internal successors, (1351), 6 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:58,940 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:58,940 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:58,941 INFO  L175             Difference]: Start difference. First operand has 247 places, 258 transitions, 620 flow. Second operand 6 states and 1351 transitions.
[2024-02-28 20:28:58,941 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 252 places, 336 transitions, 1023 flow
[2024-02-28 20:28:58,943 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 251 places, 336 transitions, 1021 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:28:58,946 INFO  L231             Difference]: Finished difference. Result has 256 places, 306 transitions, 960 flow
[2024-02-28 20:28:58,946 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=960, PETRI_PLACES=256, PETRI_TRANSITIONS=306}
[2024-02-28 20:28:58,946 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-02-28 20:28:58,947 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 306 transitions, 960 flow
[2024-02-28 20:28:58,947 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.16666666666666) internal successors, (1237), 6 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:58,947 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:28:58,947 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:28:58,947 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30
[2024-02-28 20:28:58,947 INFO  L420      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:28:58,947 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:28:58,947 INFO  L85        PathProgramCache]: Analyzing trace with hash -633029374, now seen corresponding path program 1 times
[2024-02-28 20:28:58,947 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:28:58,948 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000477269]
[2024-02-28 20:28:58,948 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:28:58,948 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:28:58,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:28:58,970 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:28:58,970 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:28:58,970 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000477269]
[2024-02-28 20:28:58,971 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000477269] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:28:58,971 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:28:58,971 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:28:58,971 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258302179]
[2024-02-28 20:28:58,971 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:28:58,971 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:28:58,971 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:28:58,972 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:28:58,972 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:28:58,988 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-02-28 20:28:58,989 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 306 transitions, 960 flow. Second operand  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:28:58,989 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:28:58,989 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-02-28 20:28:58,989 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:28:59,542 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][162], [278#(= |#race~datas~0| 0), Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 225#L1062-6true, 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 165#L1042-9true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-02-28 20:28:59,543 INFO  L294   olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event
[2024-02-28 20:28:59,543 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:28:59,543 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:28:59,543 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:28:59,582 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][162], [278#(= |#race~datas~0| 0), Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 192#L1042-10true, threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 225#L1062-6true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 248#(= |#race~threads_mask~0| 0)])
[2024-02-28 20:28:59,583 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-02-28 20:28:59,583 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:28:59,583 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:28:59,583 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:01,463 INFO  L124   PetriNetUnfolderBase]: 4929/24546 cut-off events.
[2024-02-28 20:29:01,463 INFO  L125   PetriNetUnfolderBase]: For 1623/1667 co-relation queries the response was YES.
[2024-02-28 20:29:01,527 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 35948 conditions, 24546 events. 4929/24546 cut-off events. For 1623/1667 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 315428 event pairs, 1055 based on Foata normal form. 0/21510 useless extension candidates. Maximal degree in co-relation 16682. Up to 2478 conditions per place. 
[2024-02-28 20:29:01,580 INFO  L140   encePairwiseOnDemand]: 243/249 looper letters, 20 selfloop transitions, 3 changer transitions 4/309 dead transitions.
[2024-02-28 20:29:01,581 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 309 transitions, 1017 flow
[2024-02-28 20:29:01,582 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:29:01,582 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:29:01,582 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions.
[2024-02-28 20:29:01,582 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9384203480589023
[2024-02-28 20:29:01,583 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 701 transitions.
[2024-02-28 20:29:01,583 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 701 transitions.
[2024-02-28 20:29:01,583 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:01,583 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 701 transitions.
[2024-02-28 20:29:01,584 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.66666666666666) internal successors, (701), 3 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:01,584 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:01,584 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:01,584 INFO  L175             Difference]: Start difference. First operand has 256 places, 306 transitions, 960 flow. Second operand 3 states and 701 transitions.
[2024-02-28 20:29:01,584 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 309 transitions, 1017 flow
[2024-02-28 20:29:01,599 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 309 transitions, 1017 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:29:01,602 INFO  L231             Difference]: Finished difference. Result has 256 places, 302 transitions, 951 flow
[2024-02-28 20:29:01,602 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=954, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=951, PETRI_PLACES=256, PETRI_TRANSITIONS=302}
[2024-02-28 20:29:01,602 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 17 predicate places.
[2024-02-28 20:29:01,603 INFO  L495      AbstractCegarLoop]: Abstraction has has 256 places, 302 transitions, 951 flow
[2024-02-28 20:29:01,603 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 226.0) internal successors, (678), 3 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:01,603 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:01,603 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:01,603 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31
[2024-02-28 20:29:01,603 INFO  L420      AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:01,603 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:01,604 INFO  L85        PathProgramCache]: Analyzing trace with hash -94756062, now seen corresponding path program 1 times
[2024-02-28 20:29:01,604 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:01,604 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307496301]
[2024-02-28 20:29:01,604 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:01,604 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:01,612 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:01,651 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:01,651 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:01,651 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307496301]
[2024-02-28 20:29:01,652 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307496301] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:01,652 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:01,652 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:29:01,652 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279323398]
[2024-02-28 20:29:01,652 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:01,652 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:29:01,652 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:01,653 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:29:01,653 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:29:01,752 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-02-28 20:29:01,754 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 302 transitions, 951 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:01,754 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:01,754 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-02-28 20:29:01,754 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:02,275 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 225#L1062-6true, 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, 165#L1042-9true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-02-28 20:29:02,275 INFO  L294   olderBase$Statistics]: this new event has 152 ancestors and is not cut-off event
[2024-02-28 20:29:02,275 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:29:02,275 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:29:02,275 INFO  L297   olderBase$Statistics]:   existing Event has 152 ancestors and is not cut-off event
[2024-02-28 20:29:02,311 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 192#L1042-10true, threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, 225#L1062-6true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0)])
[2024-02-28 20:29:02,311 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:02,312 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:02,312 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:02,312 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:02,357 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1064-5-->L1064-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][168], [278#(= |#race~datas~0| 0), 281#true, Black: 255#(<= |ULTIMATE.start_main_~threads_total~0#1| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 258#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), Black: 256#(and (= |ULTIMATE.start_main_~i~1#1| 0) (<= |ULTIMATE.start_main_~threads_total~0#1| 0)), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), 103#L1064-6true])
[2024-02-28 20:29:02,357 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:02,357 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:04,591 INFO  L124   PetriNetUnfolderBase]: 5049/24154 cut-off events.
[2024-02-28 20:29:04,591 INFO  L125   PetriNetUnfolderBase]: For 2077/2082 co-relation queries the response was YES.
[2024-02-28 20:29:04,682 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37787 conditions, 24154 events. 5049/24154 cut-off events. For 2077/2082 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 310190 event pairs, 1376 based on Foata normal form. 1/21535 useless extension candidates. Maximal degree in co-relation 35779. Up to 2664 conditions per place. 
[2024-02-28 20:29:04,745 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-02-28 20:29:04,745 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 308 transitions, 1015 flow
[2024-02-28 20:29:04,746 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:29:04,746 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:29:04,747 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-02-28 20:29:04,747 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-02-28 20:29:04,747 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-02-28 20:29:04,747 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-02-28 20:29:04,747 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:04,747 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-02-28 20:29:04,748 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:04,749 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:04,749 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:04,749 INFO  L175             Difference]: Start difference. First operand has 256 places, 302 transitions, 951 flow. Second operand 4 states and 927 transitions.
[2024-02-28 20:29:04,749 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 308 transitions, 1015 flow
[2024-02-28 20:29:04,774 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 308 transitions, 1005 flow, removed 5 selfloop flow, removed 3 redundant places.
[2024-02-28 20:29:04,776 INFO  L231             Difference]: Finished difference. Result has 255 places, 305 transitions, 966 flow
[2024-02-28 20:29:04,776 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=966, PETRI_PLACES=255, PETRI_TRANSITIONS=305}
[2024-02-28 20:29:04,777 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 16 predicate places.
[2024-02-28 20:29:04,777 INFO  L495      AbstractCegarLoop]: Abstraction has has 255 places, 305 transitions, 966 flow
[2024-02-28 20:29:04,777 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:04,777 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:04,777 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:04,777 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32
[2024-02-28 20:29:04,777 INFO  L420      AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:04,778 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:04,778 INFO  L85        PathProgramCache]: Analyzing trace with hash 1900959464, now seen corresponding path program 1 times
[2024-02-28 20:29:04,778 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:04,778 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42757649]
[2024-02-28 20:29:04,778 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:04,778 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:04,785 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:04,828 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:04,828 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:04,829 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42757649]
[2024-02-28 20:29:04,829 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42757649] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:04,829 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:04,829 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:29:04,829 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096308165]
[2024-02-28 20:29:04,829 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:04,830 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:29:04,830 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:04,830 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:29:04,831 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:29:04,942 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-02-28 20:29:04,943 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 305 transitions, 966 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:04,943 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:04,943 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-02-28 20:29:04,943 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:05,375 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 225#L1062-6true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, 165#L1042-9true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:05,376 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:05,376 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:05,376 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:05,376 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:05,406 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][154], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, 225#L1062-6true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:05,406 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:05,406 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:05,406 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:05,406 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:05,442 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1064-5-->L1064-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][167], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, 103#L1064-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:05,443 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:05,443 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:05,443 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:05,443 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:07,502 INFO  L124   PetriNetUnfolderBase]: 5048/24152 cut-off events.
[2024-02-28 20:29:07,503 INFO  L125   PetriNetUnfolderBase]: For 2160/2165 co-relation queries the response was YES.
[2024-02-28 20:29:07,585 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 37808 conditions, 24152 events. 5048/24152 cut-off events. For 2160/2165 co-relation queries the response was YES. Maximal size of possible extension queue 628. Compared 310015 event pairs, 1376 based on Foata normal form. 1/21476 useless extension candidates. Maximal degree in co-relation 35795. Up to 2664 conditions per place. 
[2024-02-28 20:29:07,640 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 21 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-02-28 20:29:07,640 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 307 transitions, 1020 flow
[2024-02-28 20:29:07,641 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:29:07,641 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:29:07,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 926 transitions.
[2024-02-28 20:29:07,642 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.929718875502008
[2024-02-28 20:29:07,642 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 926 transitions.
[2024-02-28 20:29:07,642 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 926 transitions.
[2024-02-28 20:29:07,642 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:07,642 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 926 transitions.
[2024-02-28 20:29:07,643 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.5) internal successors, (926), 4 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:07,643 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:07,643 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:07,643 INFO  L175             Difference]: Start difference. First operand has 255 places, 305 transitions, 966 flow. Second operand 4 states and 926 transitions.
[2024-02-28 20:29:07,643 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 307 transitions, 1020 flow
[2024-02-28 20:29:07,664 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 307 transitions, 1020 flow, removed 0 selfloop flow, removed 0 redundant places.
[2024-02-28 20:29:07,667 INFO  L231             Difference]: Finished difference. Result has 260 places, 306 transitions, 985 flow
[2024-02-28 20:29:07,667 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=966, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=985, PETRI_PLACES=260, PETRI_TRANSITIONS=306}
[2024-02-28 20:29:07,667 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 21 predicate places.
[2024-02-28 20:29:07,667 INFO  L495      AbstractCegarLoop]: Abstraction has has 260 places, 306 transitions, 985 flow
[2024-02-28 20:29:07,668 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:07,668 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:07,668 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:07,668 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33
[2024-02-28 20:29:07,668 INFO  L420      AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:07,668 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:07,668 INFO  L85        PathProgramCache]: Analyzing trace with hash -215980064, now seen corresponding path program 1 times
[2024-02-28 20:29:07,668 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:07,668 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947302727]
[2024-02-28 20:29:07,669 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:07,669 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:07,676 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:07,709 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:07,709 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:07,710 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947302727]
[2024-02-28 20:29:07,710 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947302727] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:07,710 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:07,710 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:29:07,710 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754803244]
[2024-02-28 20:29:07,710 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:07,711 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:29:07,711 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:07,711 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:29:07,711 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:29:07,795 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 225 out of 249
[2024-02-28 20:29:07,796 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 306 transitions, 985 flow. Second operand  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:07,796 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:07,796 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 249
[2024-02-28 20:29:07,797 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:08,296 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 225#L1062-6true, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 165#L1042-9true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:08,296 INFO  L294   olderBase$Statistics]: this new event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:08,296 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:08,296 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:08,296 INFO  L297   olderBase$Statistics]:   existing Event has 153 ancestors and is not cut-off event
[2024-02-28 20:29:08,325 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][155], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 192#L1042-10true, threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, 225#L1062-6true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:08,325 INFO  L294   olderBase$Statistics]: this new event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:08,325 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:08,325 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:08,325 INFO  L297   olderBase$Statistics]:   existing Event has 154 ancestors and is not cut-off event
[2024-02-28 20:29:08,359 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1064-5-->L1064-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][168], [278#(= |#race~datas~0| 0), 281#true, 288#true, Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 192#L1042-10true, threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 276#true, 103#L1064-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:08,359 INFO  L294   olderBase$Statistics]: this new event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:08,359 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:08,359 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:08,359 INFO  L297   olderBase$Statistics]:   existing Event has 155 ancestors and is not cut-off event
[2024-02-28 20:29:10,560 INFO  L124   PetriNetUnfolderBase]: 5059/24179 cut-off events.
[2024-02-28 20:29:10,560 INFO  L125   PetriNetUnfolderBase]: For 2342/2347 co-relation queries the response was YES.
[2024-02-28 20:29:10,646 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38023 conditions, 24179 events. 5059/24179 cut-off events. For 2342/2347 co-relation queries the response was YES. Maximal size of possible extension queue 632. Compared 310637 event pairs, 1382 based on Foata normal form. 1/21586 useless extension candidates. Maximal degree in co-relation 37904. Up to 2674 conditions per place. 
[2024-02-28 20:29:10,705 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/308 dead transitions.
[2024-02-28 20:29:10,705 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 308 transitions, 1041 flow
[2024-02-28 20:29:10,706 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:29:10,706 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:29:10,707 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 927 transitions.
[2024-02-28 20:29:10,707 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9307228915662651
[2024-02-28 20:29:10,707 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 927 transitions.
[2024-02-28 20:29:10,707 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 927 transitions.
[2024-02-28 20:29:10,707 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:10,707 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 927 transitions.
[2024-02-28 20:29:10,708 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 231.75) internal successors, (927), 4 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:10,709 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:10,709 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:10,709 INFO  L175             Difference]: Start difference. First operand has 260 places, 306 transitions, 985 flow. Second operand 4 states and 927 transitions.
[2024-02-28 20:29:10,709 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 308 transitions, 1041 flow
[2024-02-28 20:29:10,733 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 308 transitions, 1038 flow, removed 0 selfloop flow, removed 1 redundant places.
[2024-02-28 20:29:10,736 INFO  L231             Difference]: Finished difference. Result has 263 places, 306 transitions, 994 flow
[2024-02-28 20:29:10,736 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=982, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=994, PETRI_PLACES=263, PETRI_TRANSITIONS=306}
[2024-02-28 20:29:10,736 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 24 predicate places.
[2024-02-28 20:29:10,736 INFO  L495      AbstractCegarLoop]: Abstraction has has 263 places, 306 transitions, 994 flow
[2024-02-28 20:29:10,737 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 226.5) internal successors, (906), 4 states have internal predecessors, (906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:10,737 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:10,737 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:10,737 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34
[2024-02-28 20:29:10,737 INFO  L420      AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:10,737 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:10,737 INFO  L85        PathProgramCache]: Analyzing trace with hash 1521659098, now seen corresponding path program 1 times
[2024-02-28 20:29:10,737 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:10,737 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973748944]
[2024-02-28 20:29:10,738 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:10,738 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:10,745 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:10,778 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:10,779 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:10,779 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973748944]
[2024-02-28 20:29:10,779 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973748944] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:10,779 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:10,779 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-02-28 20:29:10,779 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495264753]
[2024-02-28 20:29:10,779 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:10,780 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-02-28 20:29:10,780 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:10,780 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-02-28 20:29:10,781 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-02-28 20:29:10,910 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-02-28 20:29:10,911 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 306 transitions, 994 flow. Second operand  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:10,911 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:10,911 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-02-28 20:29:10,911 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:11,464 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][154], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 225#L1062-6true, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 301#true, Black: 276#true, 165#L1042-9true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:11,465 INFO  L294   olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:11,465 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:11,465 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:11,465 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:11,502 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][154], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 192#L1042-10true, Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 225#L1062-6true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 301#true, Black: 276#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:11,502 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:11,502 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:11,502 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:11,502 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:11,549 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1064-5-->L1064-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][167], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, 295#true, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, 116#L1042-8true, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), 301#true, Black: 276#true, 103#L1064-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:11,550 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:11,550 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:11,550 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:11,550 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:13,801 INFO  L124   PetriNetUnfolderBase]: 5165/24367 cut-off events.
[2024-02-28 20:29:13,801 INFO  L125   PetriNetUnfolderBase]: For 2484/2489 co-relation queries the response was YES.
[2024-02-28 20:29:13,887 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 38538 conditions, 24367 events. 5165/24367 cut-off events. For 2484/2489 co-relation queries the response was YES. Maximal size of possible extension queue 648. Compared 313386 event pairs, 1478 based on Foata normal form. 1/21720 useless extension candidates. Maximal degree in co-relation 38418. Up to 2862 conditions per place. 
[2024-02-28 20:29:13,944 INFO  L140   encePairwiseOnDemand]: 245/249 looper letters, 22 selfloop transitions, 4 changer transitions 0/307 dead transitions.
[2024-02-28 20:29:13,945 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 307 transitions, 1048 flow
[2024-02-28 20:29:13,945 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2024-02-28 20:29:13,946 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2024-02-28 20:29:13,946 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 923 transitions.
[2024-02-28 20:29:13,946 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9267068273092369
[2024-02-28 20:29:13,947 INFO  L72            ComplementDD]: Start complementDD. Operand 4 states and 923 transitions.
[2024-02-28 20:29:13,947 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 4 states and 923 transitions.
[2024-02-28 20:29:13,947 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:13,947 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 923 transitions.
[2024-02-28 20:29:13,947 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 5 states, 4 states have (on average 230.75) internal successors, (923), 4 states have internal predecessors, (923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:13,948 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:13,948 INFO  L81            ComplementDD]: Finished complementDD. Result  has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:13,948 INFO  L175             Difference]: Start difference. First operand has 263 places, 306 transitions, 994 flow. Second operand 4 states and 923 transitions.
[2024-02-28 20:29:13,948 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 307 transitions, 1048 flow
[2024-02-28 20:29:13,971 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 307 transitions, 1040 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:29:13,974 INFO  L231             Difference]: Finished difference. Result has 264 places, 306 transitions, 998 flow
[2024-02-28 20:29:13,974 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=986, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=998, PETRI_PLACES=264, PETRI_TRANSITIONS=306}
[2024-02-28 20:29:13,974 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 25 predicate places.
[2024-02-28 20:29:13,974 INFO  L495      AbstractCegarLoop]: Abstraction has has 264 places, 306 transitions, 998 flow
[2024-02-28 20:29:13,975 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 4 states, 4 states have (on average 225.5) internal successors, (902), 4 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:13,975 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:13,975 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:13,975 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35
[2024-02-28 20:29:13,975 INFO  L420      AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:13,975 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:13,975 INFO  L85        PathProgramCache]: Analyzing trace with hash -410327967, now seen corresponding path program 1 times
[2024-02-28 20:29:13,975 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:13,975 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143007797]
[2024-02-28 20:29:13,976 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:13,976 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:13,983 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:13,997 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:13,997 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:13,997 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143007797]
[2024-02-28 20:29:13,997 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143007797] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:13,998 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:13,998 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:29:13,998 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272997839]
[2024-02-28 20:29:13,998 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:13,998 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:29:13,998 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:13,998 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:29:13,998 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:29:14,046 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 222 out of 249
[2024-02-28 20:29:14,047 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 306 transitions, 998 flow. Second operand  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:14,047 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:14,047 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 222 of 249
[2024-02-28 20:29:14,047 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:14,524 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][152], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, 225#L1062-6true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 301#true, Black: 276#true, 165#L1042-9true, 309#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:14,524 INFO  L294   olderBase$Statistics]: this new event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:14,524 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:14,524 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:14,524 INFO  L297   olderBase$Statistics]:   existing Event has 157 ancestors and is not cut-off event
[2024-02-28 20:29:14,559 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([678] L1062-5-->L1062-6: Formula: (let ((.cse0 (select |v_#race_30| |v_ULTIMATE.start_main_~#tids~0#1.base_17|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 1)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_17| 3)) 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_17|))))  InVars {#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  OutVars{#race=|v_#race_30|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_17|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_17|}  AuxVars[]  AssignedVars[][152], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, 225#L1062-6true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 301#true, Black: 276#true, 309#true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:14,559 INFO  L294   olderBase$Statistics]: this new event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:14,559 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:14,559 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:14,559 INFO  L297   olderBase$Statistics]:   existing Event has 158 ancestors and is not cut-off event
[2024-02-28 20:29:14,600 INFO  L292   olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([572] L1064-5-->L1064-6: Formula: (let ((.cse0 (select |v_#race_50| |v_ULTIMATE.start_main_~#tids~0#1.base_24|))) (and (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 2)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 3)) 0) (= (select .cse0 (+ |v_ULTIMATE.start_main_~#tids~0#1.offset_24| 1)) 0) (= (select .cse0 |v_ULTIMATE.start_main_~#tids~0#1.offset_24|) 0)))  InVars {#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  OutVars{#race=|v_#race_50|, ULTIMATE.start_main_~#tids~0#1.offset=|v_ULTIMATE.start_main_~#tids~0#1.offset_24|, ULTIMATE.start_main_~#tids~0#1.base=|v_ULTIMATE.start_main_~#tids~0#1.base_24|}  AuxVars[]  AssignedVars[][165], [281#true, 278#(= |#race~datas~0| 0), Black: 254#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 291#(and (<= (+ ~threads_mask~0 1) 0) (<= 2 |ULTIMATE.start_main_#t~nondet17#1|)), Black: 290#(<= (+ ~threads_mask~0 1) 0), 192#L1042-10true, 269#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 298#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= 0 (+ ~threads_mask~0 1))), threadThread1of2ForFork0InUse, Black: 268#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ 2 |ULTIMATE.start_main_~#tids~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), threadThread2of2ForFork0InUse, Black: 266#(= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0), 116#L1042-8true, Black: 264#true, Black: 267#(and (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) (+ |ULTIMATE.start_main_~#tids~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#tids~0#1.base|) |ULTIMATE.start_main_~#tids~0#1.offset|) 0)), Black: 306#(and (<= 1 (+ ~threads_mask~0 |ULTIMATE.start_main_#t~nondet17#1|)) (<= 0 (+ ~threads_mask~0 1))), 301#true, Black: 276#true, 309#true, 103#L1064-6true, Black: 248#(= |#race~threads_mask~0| 0), Black: 283#(<= (+ ~threads_mask~0 1) 0), Black: 284#(and (= |ULTIMATE.start_main_#t~nondet17#1| 1) (<= (+ ~threads_mask~0 1) 0))])
[2024-02-28 20:29:14,601 INFO  L294   olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:14,601 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:14,601 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:14,601 INFO  L297   olderBase$Statistics]:   existing Event has 159 ancestors and is not cut-off event
[2024-02-28 20:29:16,805 INFO  L124   PetriNetUnfolderBase]: 5520/25057 cut-off events.
[2024-02-28 20:29:16,806 INFO  L125   PetriNetUnfolderBase]: For 3429/3763 co-relation queries the response was YES.
[2024-02-28 20:29:16,920 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 39704 conditions, 25057 events. 5520/25057 cut-off events. For 3429/3763 co-relation queries the response was YES. Maximal size of possible extension queue 619. Compared 319405 event pairs, 1296 based on Foata normal form. 45/22259 useless extension candidates. Maximal degree in co-relation 39585. Up to 3513 conditions per place. 
[2024-02-28 20:29:16,987 INFO  L140   encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 12 changer transitions 0/320 dead transitions.
[2024-02-28 20:29:16,987 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 320 transitions, 1130 flow
[2024-02-28 20:29:16,988 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:29:16,988 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:29:16,988 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions.
[2024-02-28 20:29:16,989 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9370816599732262
[2024-02-28 20:29:16,989 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 700 transitions.
[2024-02-28 20:29:16,989 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 700 transitions.
[2024-02-28 20:29:16,989 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:16,989 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 700 transitions.
[2024-02-28 20:29:16,989 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:16,990 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:16,990 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:16,990 INFO  L175             Difference]: Start difference. First operand has 264 places, 306 transitions, 998 flow. Second operand 3 states and 700 transitions.
[2024-02-28 20:29:16,990 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 320 transitions, 1130 flow
[2024-02-28 20:29:17,009 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 320 transitions, 1122 flow, removed 0 selfloop flow, removed 3 redundant places.
[2024-02-28 20:29:17,012 INFO  L231             Difference]: Finished difference. Result has 265 places, 316 transitions, 1096 flow
[2024-02-28 20:29:17,012 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1096, PETRI_PLACES=265, PETRI_TRANSITIONS=316}
[2024-02-28 20:29:17,013 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 26 predicate places.
[2024-02-28 20:29:17,013 INFO  L495      AbstractCegarLoop]: Abstraction has has 265 places, 316 transitions, 1096 flow
[2024-02-28 20:29:17,013 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:17,013 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:17,013 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:17,013 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36
[2024-02-28 20:29:17,013 INFO  L420      AbstractCegarLoop]: === Iteration 11 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:17,013 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:17,013 INFO  L85        PathProgramCache]: Analyzing trace with hash 1020118664, now seen corresponding path program 1 times
[2024-02-28 20:29:17,014 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:17,014 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205709278]
[2024-02-28 20:29:17,014 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:17,014 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:17,027 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:17,256 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:29:17,256 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:17,256 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205709278]
[2024-02-28 20:29:17,257 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205709278] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:17,257 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:17,257 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:29:17,257 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134466608]
[2024-02-28 20:29:17,257 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:17,258 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:29:17,258 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:17,258 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:29:17,259 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:29:17,422 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 204 out of 249
[2024-02-28 20:29:17,423 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 316 transitions, 1096 flow. Second operand  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:17,423 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:17,423 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 249
[2024-02-28 20:29:17,424 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:24,723 INFO  L124   PetriNetUnfolderBase]: 16574/60846 cut-off events.
[2024-02-28 20:29:24,723 INFO  L125   PetriNetUnfolderBase]: For 13839/15322 co-relation queries the response was YES.
[2024-02-28 20:29:24,969 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 106919 conditions, 60846 events. 16574/60846 cut-off events. For 13839/15322 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 847020 event pairs, 4238 based on Foata normal form. 45/53529 useless extension candidates. Maximal degree in co-relation 106638. Up to 14784 conditions per place. 
[2024-02-28 20:29:25,128 INFO  L140   encePairwiseOnDemand]: 222/249 looper letters, 125 selfloop transitions, 136 changer transitions 0/492 dead transitions.
[2024-02-28 20:29:25,128 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 492 transitions, 2362 flow
[2024-02-28 20:29:25,129 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:29:25,129 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:29:25,129 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1387 transitions.
[2024-02-28 20:29:25,130 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.928380187416332
[2024-02-28 20:29:25,130 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1387 transitions.
[2024-02-28 20:29:25,130 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1387 transitions.
[2024-02-28 20:29:25,130 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:25,130 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1387 transitions.
[2024-02-28 20:29:25,132 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 231.16666666666666) internal successors, (1387), 6 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:25,132 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:25,132 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:25,133 INFO  L175             Difference]: Start difference. First operand has 265 places, 316 transitions, 1096 flow. Second operand 6 states and 1387 transitions.
[2024-02-28 20:29:25,133 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 492 transitions, 2362 flow
[2024-02-28 20:29:25,208 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 492 transitions, 2338 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:29:25,212 INFO  L231             Difference]: Finished difference. Result has 272 places, 449 transitions, 2210 flow
[2024-02-28 20:29:25,212 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1072, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=255, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=272, PETRI_TRANSITIONS=449}
[2024-02-28 20:29:25,213 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 33 predicate places.
[2024-02-28 20:29:25,213 INFO  L495      AbstractCegarLoop]: Abstraction has has 272 places, 449 transitions, 2210 flow
[2024-02-28 20:29:25,213 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 206.66666666666666) internal successors, (1240), 6 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:25,213 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:25,213 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:25,214 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37
[2024-02-28 20:29:25,214 INFO  L420      AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:25,214 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:25,214 INFO  L85        PathProgramCache]: Analyzing trace with hash -405212923, now seen corresponding path program 1 times
[2024-02-28 20:29:25,214 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:25,214 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483110168]
[2024-02-28 20:29:25,214 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:25,214 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:25,229 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:25,406 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:29:25,406 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:25,406 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483110168]
[2024-02-28 20:29:25,406 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483110168] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:25,406 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:25,407 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-02-28 20:29:25,407 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482727024]
[2024-02-28 20:29:25,407 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:25,407 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-02-28 20:29:25,408 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:25,408 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-02-28 20:29:25,408 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30
[2024-02-28 20:29:25,772 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 214 out of 249
[2024-02-28 20:29:25,773 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 449 transitions, 2210 flow. Second operand  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:25,774 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:25,774 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 249
[2024-02-28 20:29:25,774 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:34,265 INFO  L124   PetriNetUnfolderBase]: 16236/68449 cut-off events.
[2024-02-28 20:29:34,265 INFO  L125   PetriNetUnfolderBase]: For 29722/31002 co-relation queries the response was YES.
[2024-02-28 20:29:34,729 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 127436 conditions, 68449 events. 16236/68449 cut-off events. For 29722/31002 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 1018953 event pairs, 2971 based on Foata normal form. 52/60438 useless extension candidates. Maximal degree in co-relation 127144. Up to 12712 conditions per place. 
[2024-02-28 20:29:34,911 INFO  L140   encePairwiseOnDemand]: 234/249 looper letters, 132 selfloop transitions, 119 changer transitions 0/581 dead transitions.
[2024-02-28 20:29:34,911 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 581 transitions, 3612 flow
[2024-02-28 20:29:34,912 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. 
[2024-02-28 20:29:34,912 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6 states.
[2024-02-28 20:29:34,913 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1371 transitions.
[2024-02-28 20:29:34,913 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9176706827309237
[2024-02-28 20:29:34,913 INFO  L72            ComplementDD]: Start complementDD. Operand 6 states and 1371 transitions.
[2024-02-28 20:29:34,913 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 6 states and 1371 transitions.
[2024-02-28 20:29:34,913 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:34,914 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1371 transitions.
[2024-02-28 20:29:34,914 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 7 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:34,915 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:34,915 INFO  L81            ComplementDD]: Finished complementDD. Result  has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:34,915 INFO  L175             Difference]: Start difference. First operand has 272 places, 449 transitions, 2210 flow. Second operand 6 states and 1371 transitions.
[2024-02-28 20:29:34,916 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 581 transitions, 3612 flow
[2024-02-28 20:29:35,023 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 581 transitions, 3558 flow, removed 27 selfloop flow, removed 0 redundant places.
[2024-02-28 20:29:35,028 INFO  L231             Difference]: Finished difference. Result has 282 places, 563 transitions, 3576 flow
[2024-02-28 20:29:35,029 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2156, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=402, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3576, PETRI_PLACES=282, PETRI_TRANSITIONS=563}
[2024-02-28 20:29:35,029 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 43 predicate places.
[2024-02-28 20:29:35,029 INFO  L495      AbstractCegarLoop]: Abstraction has has 282 places, 563 transitions, 3576 flow
[2024-02-28 20:29:35,030 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 6 states, 6 states have (on average 215.83333333333334) internal successors, (1295), 6 states have internal predecessors, (1295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:35,030 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:35,030 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:35,030 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38
[2024-02-28 20:29:35,030 INFO  L420      AbstractCegarLoop]: === Iteration 13 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:35,030 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:35,031 INFO  L85        PathProgramCache]: Analyzing trace with hash -24409336, now seen corresponding path program 1 times
[2024-02-28 20:29:35,031 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:35,031 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002208265]
[2024-02-28 20:29:35,031 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:35,031 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:35,048 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:35,344 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:29:35,345 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:35,345 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002208265]
[2024-02-28 20:29:35,345 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002208265] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:35,345 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:35,345 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:29:35,345 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049860259]
[2024-02-28 20:29:35,345 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:35,346 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:29:35,346 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:35,347 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:29:35,347 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:29:36,233 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249
[2024-02-28 20:29:36,234 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 563 transitions, 3576 flow. Second operand  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:36,234 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:36,234 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249
[2024-02-28 20:29:36,234 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:29:47,951 INFO  L124   PetriNetUnfolderBase]: 23388/78934 cut-off events.
[2024-02-28 20:29:47,951 INFO  L125   PetriNetUnfolderBase]: For 59335/64971 co-relation queries the response was YES.
[2024-02-28 20:29:48,369 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 182675 conditions, 78934 events. 23388/78934 cut-off events. For 59335/64971 co-relation queries the response was YES. Maximal size of possible extension queue 2198. Compared 1115229 event pairs, 5092 based on Foata normal form. 846/71500 useless extension candidates. Maximal degree in co-relation 182391. Up to 14927 conditions per place. 
[2024-02-28 20:29:48,612 INFO  L140   encePairwiseOnDemand]: 229/249 looper letters, 424 selfloop transitions, 224 changer transitions 0/874 dead transitions.
[2024-02-28 20:29:48,612 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 874 transitions, 7068 flow
[2024-02-28 20:29:48,613 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. 
[2024-02-28 20:29:48,613 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 11 states.
[2024-02-28 20:29:48,613 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2378 transitions.
[2024-02-28 20:29:48,614 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8682000730193501
[2024-02-28 20:29:48,614 INFO  L72            ComplementDD]: Start complementDD. Operand 11 states and 2378 transitions.
[2024-02-28 20:29:48,614 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 11 states and 2378 transitions.
[2024-02-28 20:29:48,614 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:29:48,614 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2378 transitions.
[2024-02-28 20:29:48,616 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 12 states, 11 states have (on average 216.1818181818182) internal successors, (2378), 11 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:48,618 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:48,618 INFO  L81            ComplementDD]: Finished complementDD. Result  has 12 states, 12 states have (on average 249.0) internal successors, (2988), 12 states have internal predecessors, (2988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:48,618 INFO  L175             Difference]: Start difference. First operand has 282 places, 563 transitions, 3576 flow. Second operand 11 states and 2378 transitions.
[2024-02-28 20:29:48,618 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 874 transitions, 7068 flow
[2024-02-28 20:29:49,098 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 874 transitions, 7020 flow, removed 24 selfloop flow, removed 0 redundant places.
[2024-02-28 20:29:49,106 INFO  L231             Difference]: Finished difference. Result has 299 places, 689 transitions, 5536 flow
[2024-02-28 20:29:49,106 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3528, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=124, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=400, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=5536, PETRI_PLACES=299, PETRI_TRANSITIONS=689}
[2024-02-28 20:29:49,107 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 60 predicate places.
[2024-02-28 20:29:49,107 INFO  L495      AbstractCegarLoop]: Abstraction has has 299 places, 689 transitions, 5536 flow
[2024-02-28 20:29:49,107 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 200.1) internal successors, (2001), 10 states have internal predecessors, (2001), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:49,107 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:29:49,108 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:29:49,108 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39
[2024-02-28 20:29:49,108 INFO  L420      AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:29:49,108 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:29:49,108 INFO  L85        PathProgramCache]: Analyzing trace with hash 663144032, now seen corresponding path program 1 times
[2024-02-28 20:29:49,108 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:29:49,108 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174816369]
[2024-02-28 20:29:49,108 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:29:49,109 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:29:49,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:29:49,413 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:29:49,413 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:29:49,413 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174816369]
[2024-02-28 20:29:49,413 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174816369] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:29:49,413 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:29:49,414 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2024-02-28 20:29:49,414 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767005692]
[2024-02-28 20:29:49,414 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:29:49,414 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2024-02-28 20:29:49,415 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:29:49,415 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2024-02-28 20:29:49,415 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90
[2024-02-28 20:29:50,317 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 201 out of 249
[2024-02-28 20:29:50,319 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 689 transitions, 5536 flow. Second operand  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:29:50,319 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:29:50,319 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 249
[2024-02-28 20:29:50,319 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:30:01,688 INFO  L124   PetriNetUnfolderBase]: 19915/73204 cut-off events.
[2024-02-28 20:30:01,689 INFO  L125   PetriNetUnfolderBase]: For 104189/107858 co-relation queries the response was YES.
[2024-02-28 20:30:02,164 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 183545 conditions, 73204 events. 19915/73204 cut-off events. For 104189/107858 co-relation queries the response was YES. Maximal size of possible extension queue 2069. Compared 1062837 event pairs, 4567 based on Foata normal form. 1035/66231 useless extension candidates. Maximal degree in co-relation 183251. Up to 20516 conditions per place. 
[2024-02-28 20:30:02,407 INFO  L140   encePairwiseOnDemand]: 237/249 looper letters, 404 selfloop transitions, 18 changer transitions 0/702 dead transitions.
[2024-02-28 20:30:02,408 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 702 transitions, 6478 flow
[2024-02-28 20:30:02,409 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. 
[2024-02-28 20:30:02,409 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10 states.
[2024-02-28 20:30:02,409 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2072 transitions.
[2024-02-28 20:30:02,410 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8321285140562249
[2024-02-28 20:30:02,410 INFO  L72            ComplementDD]: Start complementDD. Operand 10 states and 2072 transitions.
[2024-02-28 20:30:02,410 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 10 states and 2072 transitions.
[2024-02-28 20:30:02,410 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:30:02,410 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 2072 transitions.
[2024-02-28 20:30:02,412 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 11 states, 10 states have (on average 207.2) internal successors, (2072), 10 states have internal predecessors, (2072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:02,413 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:02,413 INFO  L81            ComplementDD]: Finished complementDD. Result  has 11 states, 11 states have (on average 249.0) internal successors, (2739), 11 states have internal predecessors, (2739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:02,413 INFO  L175             Difference]: Start difference. First operand has 299 places, 689 transitions, 5536 flow. Second operand 10 states and 2072 transitions.
[2024-02-28 20:30:02,413 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 702 transitions, 6478 flow
[2024-02-28 20:30:03,327 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 702 transitions, 6434 flow, removed 19 selfloop flow, removed 3 redundant places.
[2024-02-28 20:30:03,334 INFO  L231             Difference]: Finished difference. Result has 306 places, 690 transitions, 5564 flow
[2024-02-28 20:30:03,334 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5480, PETRI_DIFFERENCE_MINUEND_PLACES=293, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=5564, PETRI_PLACES=306, PETRI_TRANSITIONS=690}
[2024-02-28 20:30:03,335 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 67 predicate places.
[2024-02-28 20:30:03,335 INFO  L495      AbstractCegarLoop]: Abstraction has has 306 places, 690 transitions, 5564 flow
[2024-02-28 20:30:03,335 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 10 states have (on average 203.0) internal successors, (2030), 10 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:03,335 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:30:03,335 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:30:03,335 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40
[2024-02-28 20:30:03,336 INFO  L420      AbstractCegarLoop]: === Iteration 15 === Targeting threadErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:30:03,336 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:30:03,336 INFO  L85        PathProgramCache]: Analyzing trace with hash 1146686486, now seen corresponding path program 1 times
[2024-02-28 20:30:03,336 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:30:03,336 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142497623]
[2024-02-28 20:30:03,336 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:30:03,336 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:30:03,350 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:30:03,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:30:03,369 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:30:03,369 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142497623]
[2024-02-28 20:30:03,369 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142497623] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:30:03,369 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-02-28 20:30:03,369 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-02-28 20:30:03,369 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072993777]
[2024-02-28 20:30:03,369 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:30:03,370 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-02-28 20:30:03,370 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:30:03,370 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-02-28 20:30:03,370 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-02-28 20:30:03,416 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 224 out of 249
[2024-02-28 20:30:03,417 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 690 transitions, 5564 flow. Second operand  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:03,417 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:30:03,417 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 249
[2024-02-28 20:30:03,417 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:30:14,917 INFO  L124   PetriNetUnfolderBase]: 17522/73951 cut-off events.
[2024-02-28 20:30:14,917 INFO  L125   PetriNetUnfolderBase]: For 78715/82802 co-relation queries the response was YES.
[2024-02-28 20:30:15,455 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 164471 conditions, 73951 events. 17522/73951 cut-off events. For 78715/82802 co-relation queries the response was YES. Maximal size of possible extension queue 2010. Compared 1115994 event pairs, 2571 based on Foata normal form. 247/66333 useless extension candidates. Maximal degree in co-relation 164099. Up to 9054 conditions per place. 
[2024-02-28 20:30:15,675 INFO  L140   encePairwiseOnDemand]: 240/249 looper letters, 38 selfloop transitions, 19 changer transitions 0/711 dead transitions.
[2024-02-28 20:30:15,675 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 711 transitions, 5772 flow
[2024-02-28 20:30:15,676 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2024-02-28 20:30:15,676 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2024-02-28 20:30:15,676 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 707 transitions.
[2024-02-28 20:30:15,677 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.9464524765729585
[2024-02-28 20:30:15,677 INFO  L72            ComplementDD]: Start complementDD. Operand 3 states and 707 transitions.
[2024-02-28 20:30:15,677 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 3 states and 707 transitions.
[2024-02-28 20:30:15,677 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:30:15,677 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 707 transitions.
[2024-02-28 20:30:15,678 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 4 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:15,678 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:15,678 INFO  L81            ComplementDD]: Finished complementDD. Result  has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:15,679 INFO  L175             Difference]: Start difference. First operand has 306 places, 690 transitions, 5564 flow. Second operand 3 states and 707 transitions.
[2024-02-28 20:30:15,679 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 711 transitions, 5772 flow
[2024-02-28 20:30:16,209 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 711 transitions, 5736 flow, removed 4 selfloop flow, removed 5 redundant places.
[2024-02-28 20:30:16,215 INFO  L231             Difference]: Finished difference. Result has 305 places, 705 transitions, 5710 flow
[2024-02-28 20:30:16,216 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5528, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=5710, PETRI_PLACES=305, PETRI_TRANSITIONS=705}
[2024-02-28 20:30:16,216 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 66 predicate places.
[2024-02-28 20:30:16,216 INFO  L495      AbstractCegarLoop]: Abstraction has has 305 places, 705 transitions, 5710 flow
[2024-02-28 20:30:16,216 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 3 states, 3 states have (on average 227.66666666666666) internal successors, (683), 3 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:16,217 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:30:16,217 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:30:16,217 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41
[2024-02-28 20:30:16,217 INFO  L420      AbstractCegarLoop]: === Iteration 16 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:30:16,217 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:30:16,217 INFO  L85        PathProgramCache]: Analyzing trace with hash -1511304280, now seen corresponding path program 1 times
[2024-02-28 20:30:16,217 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:30:16,217 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001419222]
[2024-02-28 20:30:16,217 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:30:16,217 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:30:16,234 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:30:16,849 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:30:16,849 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:30:16,849 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001419222]
[2024-02-28 20:30:16,850 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001419222] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:30:16,850 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1405288502]
[2024-02-28 20:30:16,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:30:16,851 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:30:16,851 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:30:16,853 INFO  L229       MonitoredProcess]: Starting monitored process 12 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:30:16,854 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process
[2024-02-28 20:30:17,015 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:30:17,016 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 35 conjunts are in the unsatisfiable core
[2024-02-28 20:30:17,022 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:30:17,030 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:30:17,059 INFO  L349             Elim1Store]: treesize reduction 18, result has 35.7 percent of original size
[2024-02-28 20:30:17,059 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21
[2024-02-28 20:30:17,145 INFO  L349             Elim1Store]: treesize reduction 8, result has 61.9 percent of original size
[2024-02-28 20:30:17,146 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22
[2024-02-28 20:30:17,598 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:30:17,599 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32
[2024-02-28 20:30:17,685 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12
[2024-02-28 20:30:17,715 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:30:17,728 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:30:17,750 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:30:17,751 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:30:17,772 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:30:17,773 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:30:17,801 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:17,817 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-02-28 20:30:17,818 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:30:17,818 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1405288502] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:30:17,818 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:30:17,818 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [14] total 19
[2024-02-28 20:30:17,819 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191737539]
[2024-02-28 20:30:17,819 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:30:17,819 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 14 states
[2024-02-28 20:30:17,820 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:30:17,820 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants.
[2024-02-28 20:30:17,820 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380
[2024-02-28 20:30:18,858 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249
[2024-02-28 20:30:18,861 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 705 transitions, 5710 flow. Second operand  has 14 states, 14 states have (on average 187.35714285714286) internal successors, (2623), 14 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:18,861 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:30:18,861 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249
[2024-02-28 20:30:18,861 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:30:40,708 INFO  L124   PetriNetUnfolderBase]: 37745/118858 cut-off events.
[2024-02-28 20:30:40,708 INFO  L125   PetriNetUnfolderBase]: For 214146/215327 co-relation queries the response was YES.
[2024-02-28 20:30:41,673 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 324655 conditions, 118858 events. 37745/118858 cut-off events. For 214146/215327 co-relation queries the response was YES. Maximal size of possible extension queue 3053. Compared 1722655 event pairs, 6620 based on Foata normal form. 227/108406 useless extension candidates. Maximal degree in co-relation 323882. Up to 14794 conditions per place. 
[2024-02-28 20:30:42,137 INFO  L140   encePairwiseOnDemand]: 225/249 looper letters, 1026 selfloop transitions, 487 changer transitions 0/1737 dead transitions.
[2024-02-28 20:30:42,137 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 1737 transitions, 19545 flow
[2024-02-28 20:30:42,138 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. 
[2024-02-28 20:30:42,138 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 20 states.
[2024-02-28 20:30:42,140 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3980 transitions.
[2024-02-28 20:30:42,140 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7991967871485943
[2024-02-28 20:30:42,140 INFO  L72            ComplementDD]: Start complementDD. Operand 20 states and 3980 transitions.
[2024-02-28 20:30:42,140 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 3980 transitions.
[2024-02-28 20:30:42,141 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:30:42,141 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3980 transitions.
[2024-02-28 20:30:42,143 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 21 states, 20 states have (on average 199.0) internal successors, (3980), 20 states have internal predecessors, (3980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:42,146 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:42,146 INFO  L81            ComplementDD]: Finished complementDD. Result  has 21 states, 21 states have (on average 249.0) internal successors, (5229), 21 states have internal predecessors, (5229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:42,146 INFO  L175             Difference]: Start difference. First operand has 305 places, 705 transitions, 5710 flow. Second operand 20 states and 3980 transitions.
[2024-02-28 20:30:42,146 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 1737 transitions, 19545 flow
[2024-02-28 20:30:44,376 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1737 transitions, 19507 flow, removed 0 selfloop flow, removed 2 redundant places.
[2024-02-28 20:30:44,389 INFO  L231             Difference]: Finished difference. Result has 332 places, 1116 transitions, 12628 flow
[2024-02-28 20:30:44,390 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=5672, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=12628, PETRI_PLACES=332, PETRI_TRANSITIONS=1116}
[2024-02-28 20:30:44,390 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 93 predicate places.
[2024-02-28 20:30:44,390 INFO  L495      AbstractCegarLoop]: Abstraction has has 332 places, 1116 transitions, 12628 flow
[2024-02-28 20:30:44,391 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 14 states, 14 states have (on average 187.35714285714286) internal successors, (2623), 14 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:44,391 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:30:44,391 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:30:44,398 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0
[2024-02-28 20:30:44,591 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,12 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:30:44,596 INFO  L420      AbstractCegarLoop]: === Iteration 17 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:30:44,596 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:30:44,596 INFO  L85        PathProgramCache]: Analyzing trace with hash -382809828, now seen corresponding path program 2 times
[2024-02-28 20:30:44,597 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:30:44,597 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974100269]
[2024-02-28 20:30:44,597 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:30:44,597 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:30:44,629 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:30:45,428 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:30:45,428 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:30:45,428 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974100269]
[2024-02-28 20:30:45,428 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974100269] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:30:45,429 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869054166]
[2024-02-28 20:30:45,429 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-02-28 20:30:45,429 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:30:45,429 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:30:45,430 INFO  L229       MonitoredProcess]: Starting monitored process 13 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:30:45,431 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process
[2024-02-28 20:30:45,629 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-02-28 20:30:45,630 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:30:45,631 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 38 conjunts are in the unsatisfiable core
[2024-02-28 20:30:45,636 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:30:45,672 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:30:45,761 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:30:45,762 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:30:46,254 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:30:46,254 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:30:46,326 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:30:46,326 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:30:46,344 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11
[2024-02-28 20:30:46,408 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27
[2024-02-28 20:30:46,477 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:30:46,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42
[2024-02-28 20:30:46,558 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:30:46,559 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57
[2024-02-28 20:30:46,867 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:30:46,943 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:30:46,944 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:46,981 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:30:46,982 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:47,001 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:30:47,002 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:47,033 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:30:47,034 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:47,079 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 45
[2024-02-28 20:30:47,089 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:30:47,089 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:30:47,090 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869054166] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:30:47,090 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:30:47,090 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [15] total 26
[2024-02-28 20:30:47,090 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744508372]
[2024-02-28 20:30:47,090 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:30:47,090 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 15 states
[2024-02-28 20:30:47,090 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:30:47,091 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants.
[2024-02-28 20:30:47,091 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702
[2024-02-28 20:30:48,434 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 186 out of 249
[2024-02-28 20:30:48,436 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 1116 transitions, 12628 flow. Second operand  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:30:48,436 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:30:48,436 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 249
[2024-02-28 20:30:48,436 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:31:15,738 INFO  L124   PetriNetUnfolderBase]: 37023/114031 cut-off events.
[2024-02-28 20:31:15,739 INFO  L125   PetriNetUnfolderBase]: For 348265/352306 co-relation queries the response was YES.
[2024-02-28 20:31:16,817 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 350646 conditions, 114031 events. 37023/114031 cut-off events. For 348265/352306 co-relation queries the response was YES. Maximal size of possible extension queue 3038. Compared 1635819 event pairs, 6496 based on Foata normal form. 706/103565 useless extension candidates. Maximal degree in co-relation 350246. Up to 18658 conditions per place. 
[2024-02-28 20:31:17,310 INFO  L140   encePairwiseOnDemand]: 221/249 looper letters, 814 selfloop transitions, 789 changer transitions 28/1856 dead transitions.
[2024-02-28 20:31:17,311 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 1856 transitions, 24287 flow
[2024-02-28 20:31:17,312 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2024-02-28 20:31:17,313 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 25 states.
[2024-02-28 20:31:17,315 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5046 transitions.
[2024-02-28 20:31:17,316 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.8106024096385542
[2024-02-28 20:31:17,316 INFO  L72            ComplementDD]: Start complementDD. Operand 25 states and 5046 transitions.
[2024-02-28 20:31:17,316 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 25 states and 5046 transitions.
[2024-02-28 20:31:17,317 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:31:17,317 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5046 transitions.
[2024-02-28 20:31:17,321 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 26 states, 25 states have (on average 201.84) internal successors, (5046), 25 states have internal predecessors, (5046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:31:17,323 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:31:17,324 INFO  L81            ComplementDD]: Finished complementDD. Result  has 26 states, 26 states have (on average 249.0) internal successors, (6474), 26 states have internal predecessors, (6474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:31:17,324 INFO  L175             Difference]: Start difference. First operand has 332 places, 1116 transitions, 12628 flow. Second operand 25 states and 5046 transitions.
[2024-02-28 20:31:17,324 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 1856 transitions, 24287 flow
[2024-02-28 20:31:21,681 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 350 places, 1856 transitions, 24157 flow, removed 59 selfloop flow, removed 6 redundant places.
[2024-02-28 20:31:21,746 INFO  L231             Difference]: Finished difference. Result has 360 places, 1423 transitions, 19922 flow
[2024-02-28 20:31:21,747 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=12504, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=481, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=19922, PETRI_PLACES=360, PETRI_TRANSITIONS=1423}
[2024-02-28 20:31:21,747 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 121 predicate places.
[2024-02-28 20:31:21,747 INFO  L495      AbstractCegarLoop]: Abstraction has has 360 places, 1423 transitions, 19922 flow
[2024-02-28 20:31:21,748 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 15 states, 15 states have (on average 188.2) internal successors, (2823), 15 states have internal predecessors, (2823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:31:21,748 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:31:21,748 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:31:21,753 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0
[2024-02-28 20:31:21,948 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43
[2024-02-28 20:31:21,949 INFO  L420      AbstractCegarLoop]: === Iteration 18 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:31:21,950 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:31:21,950 INFO  L85        PathProgramCache]: Analyzing trace with hash 2131822110, now seen corresponding path program 3 times
[2024-02-28 20:31:21,951 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:31:21,951 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099394138]
[2024-02-28 20:31:21,951 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:31:21,952 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:31:21,973 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:31:22,718 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:31:22,718 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:31:22,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099394138]
[2024-02-28 20:31:22,719 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099394138] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:31:22,719 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124694084]
[2024-02-28 20:31:22,719 INFO  L93    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-02-28 20:31:22,720 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:31:22,720 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:31:22,721 INFO  L229       MonitoredProcess]: Starting monitored process 14 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:31:22,723 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process
[2024-02-28 20:31:22,935 INFO  L228   tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2024-02-28 20:31:22,935 INFO  L229   tOrderPrioritization]: Conjunction of SSA is unsat
[2024-02-28 20:31:22,937 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-02-28 20:31:22,942 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:31:23,139 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:31:23,276 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:31:23,276 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:31:24,568 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:31:24,569 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33
[2024-02-28 20:31:24,992 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:31:24,993 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:31:25,045 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:31:25,491 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:31:25,570 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:31:25,661 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:31:25,792 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:31:25,903 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:31:25,904 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:31:25,931 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:31:25,932 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:31:25,979 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:31:25,980 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:31:26,014 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:31:26,015 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:31:26,153 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:31:26,222 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:31:26,222 INFO  L323         TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-02-28 20:31:26,223 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [124694084] provided 1 perfect and 0 imperfect interpolant sequences
[2024-02-28 20:31:26,223 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-02-28 20:31:26,223 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [15] total 37
[2024-02-28 20:31:26,223 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495705458]
[2024-02-28 20:31:26,224 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-02-28 20:31:26,224 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 24 states
[2024-02-28 20:31:26,225 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:31:26,225 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants.
[2024-02-28 20:31:26,226 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1245, Unknown=0, NotChecked=0, Total=1406
[2024-02-28 20:31:31,006 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 162 out of 249
[2024-02-28 20:31:31,008 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 1423 transitions, 19922 flow. Second operand  has 24 states, 24 states have (on average 164.16666666666666) internal successors, (3940), 24 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:31:31,008 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:31:31,008 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 249
[2024-02-28 20:31:31,008 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
[2024-02-28 20:33:04,054 INFO  L124   PetriNetUnfolderBase]: 116653/344982 cut-off events.
[2024-02-28 20:33:04,054 INFO  L125   PetriNetUnfolderBase]: For 1442575/1446597 co-relation queries the response was YES.
[2024-02-28 20:33:08,120 INFO  L83            FinitePrefix]: Finished finitePrefix Result has 1131019 conditions, 344982 events. 116653/344982 cut-off events. For 1442575/1446597 co-relation queries the response was YES. Maximal size of possible extension queue 8940. Compared 5559629 event pairs, 25450 based on Foata normal form. 1119/311499 useless extension candidates. Maximal degree in co-relation 1120050. Up to 62327 conditions per place. 
[2024-02-28 20:33:09,636 INFO  L140   encePairwiseOnDemand]: 200/249 looper letters, 3322 selfloop transitions, 1690 changer transitions 2/5215 dead transitions.
[2024-02-28 20:33:09,636 INFO  L145   encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 5215 transitions, 84380 flow
[2024-02-28 20:33:09,649 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. 
[2024-02-28 20:33:09,649 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 49 states.
[2024-02-28 20:33:09,653 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 8780 transitions.
[2024-02-28 20:33:09,656 INFO  L516   CegarLoopForPetriNet]: DFA transition density 0.7196131464634047
[2024-02-28 20:33:09,656 INFO  L72            ComplementDD]: Start complementDD. Operand 49 states and 8780 transitions.
[2024-02-28 20:33:09,656 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 49 states and 8780 transitions.
[2024-02-28 20:33:09,659 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2024-02-28 20:33:09,659 INFO  L117    ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 8780 transitions.
[2024-02-28 20:33:09,666 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends  has 50 states, 49 states have (on average 179.18367346938774) internal successors, (8780), 49 states have internal predecessors, (8780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:33:09,672 INFO  L131    ReachableStatesCopy]: Finished reachableStatesCopy Result  has 50 states, 50 states have (on average 249.0) internal successors, (12450), 50 states have internal predecessors, (12450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:33:09,672 INFO  L81            ComplementDD]: Finished complementDD. Result  has 50 states, 50 states have (on average 249.0) internal successors, (12450), 50 states have internal predecessors, (12450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:33:09,672 INFO  L175             Difference]: Start difference. First operand has 360 places, 1423 transitions, 19922 flow. Second operand 49 states and 8780 transitions.
[2024-02-28 20:33:09,673 INFO  L82        GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 5215 transitions, 84380 flow
[2024-02-28 20:34:04,932 INFO  L88        GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 5215 transitions, 81774 flow, removed 1126 selfloop flow, removed 10 redundant places.
[2024-02-28 20:34:04,983 INFO  L231             Difference]: Finished difference. Result has 430 places, 3148 transitions, 56310 flow
[2024-02-28 20:34:04,984 INFO  L264   CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19064, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=374, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=56310, PETRI_PLACES=430, PETRI_TRANSITIONS=3148}
[2024-02-28 20:34:04,984 INFO  L281   CegarLoopForPetriNet]: 239 programPoint places, 191 predicate places.
[2024-02-28 20:34:04,984 INFO  L495      AbstractCegarLoop]: Abstraction has has 430 places, 3148 transitions, 56310 flow
[2024-02-28 20:34:04,985 INFO  L496      AbstractCegarLoop]: INTERPOLANT automaton has  has 24 states, 24 states have (on average 164.16666666666666) internal successors, (3940), 24 states have internal predecessors, (3940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:34:04,985 INFO  L200   CegarLoopForPetriNet]: Found error trace
[2024-02-28 20:34:04,985 INFO  L208   CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-02-28 20:34:04,992 INFO  L552       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0
[2024-02-28 20:34:05,186 WARN  L477      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,14 /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:34:05,187 INFO  L420      AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (and 19 more)] ===
[2024-02-28 20:34:05,187 INFO  L160       PredicateUnifier]: Initialized classic predicate unifier
[2024-02-28 20:34:05,188 INFO  L85        PathProgramCache]: Analyzing trace with hash -672353768, now seen corresponding path program 1 times
[2024-02-28 20:34:05,188 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-02-28 20:34:05,188 INFO  L334   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160854981]
[2024-02-28 20:34:05,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:34:05,189 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-02-28 20:34:05,227 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:34:05,811 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:34:05,811 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-02-28 20:34:05,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160854981]
[2024-02-28 20:34:05,812 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160854981] provided 0 perfect and 1 imperfect interpolant sequences
[2024-02-28 20:34:05,812 INFO  L334   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031594101]
[2024-02-28 20:34:05,812 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-02-28 20:34:05,812 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-02-28 20:34:05,812 INFO  L189       MonitoredProcess]: No working directory specified, using /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3
[2024-02-28 20:34:05,813 INFO  L229       MonitoredProcess]: Starting monitored process 15 with /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null)
[2024-02-28 20:34:05,815 INFO  L327       MonitoredProcess]: [MP /mnt/goblint-svcomp/benchexec/tools-pldi24/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process
[2024-02-28 20:34:06,028 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-02-28 20:34:06,030 INFO  L262         TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 63 conjunts are in the unsatisfiable core
[2024-02-28 20:34:06,035 INFO  L285         TraceCheckSpWp]: Computing forward predicates...
[2024-02-28 20:34:06,197 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2024-02-28 20:34:06,343 INFO  L349             Elim1Store]: treesize reduction 4, result has 66.7 percent of original size
[2024-02-28 20:34:06,343 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15
[2024-02-28 20:34:07,243 INFO  L349             Elim1Store]: treesize reduction 19, result has 20.8 percent of original size
[2024-02-28 20:34:07,243 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45
[2024-02-28 20:34:07,248 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:34:07,248 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11
[2024-02-28 20:34:07,476 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:34:07,477 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19
[2024-02-28 20:34:07,488 INFO  L190   IndexEqualityManager]: detected not equals via solver
[2024-02-28 20:34:07,489 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11
[2024-02-28 20:34:07,658 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13
[2024-02-28 20:34:07,663 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3
[2024-02-28 20:34:07,746 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7
[2024-02-28 20:34:07,794 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18
[2024-02-28 20:34:07,857 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28
[2024-02-28 20:34:07,947 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38
[2024-02-28 20:34:08,029 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26
[2024-02-28 20:34:08,094 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:34:08,094 INFO  L327         TraceCheckSpWp]: Computing backward predicates...
[2024-02-28 20:34:08,123 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse0)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store |c_#race| c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse0)) 0)))) is different from false
[2024-02-28 20:34:08,145 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0)))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)))))) is different from false
[2024-02-28 20:34:08,172 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse1 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse2)) (.cse3 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse1) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse2)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= 0 (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse2)))) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)))))) is different from false
[2024-02-28 20:34:08,192 WARN  L854   $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~i~1#1| 4))) (let ((.cse2 (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| 1 .cse1)) (.cse3 (+ 2 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) (.cse4 (+ 3 |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base| (store (store (store (select |c_#race| |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2 0) .cse3 0) .cse4 0)))) (and (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) (+ |c_ULTIMATE.start_main_#t~mem25#1.offset| .cse1)) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse2) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse3) 0)) (forall ((v_ArrVal_2149 (Array Int Int))) (= (select (select (store .cse0 c_~datas~0.base v_ArrVal_2149) |c_ULTIMATE.start_main_#t~mem25#1.base|) .cse4) 0)))))) is different from false
[2024-02-28 20:34:08,207 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:34:08,207 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67
[2024-02-28 20:34:08,229 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:34:08,229 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39
[2024-02-28 20:34:08,234 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3
[2024-02-28 20:34:08,241 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:34:08,241 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:34:08,246 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:34:08,246 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1
[2024-02-28 20:34:08,251 INFO  L349             Elim1Store]: treesize reduction 51, result has 1.9 percent of original size
[2024-02-28 20:34:08,251 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1
[2024-02-28 20:34:08,387 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_2140) c_~datas~0.base v_ArrVal_2142) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:34:08,405 WARN  L854   $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2142 (Array Int Int)) (v_ArrVal_2140 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) v_ArrVal_2140) c_~datas~0.base v_ArrVal_2142) |c_ULTIMATE.start_main_~#tids~0#1.base|) |c_ULTIMATE.start_main_~#tids~0#1.offset|) c_~datas~0.base))) is different from false
[2024-02-28 20:34:08,810 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 119
[2024-02-28 20:34:08,816 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50
[2024-02-28 20:34:08,822 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46
[2024-02-28 20:34:08,826 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4
[2024-02-28 20:34:08,968 INFO  L349             Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2024-02-28 20:34:08,969 INFO  L378             Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 40
[2024-02-28 20:34:09,071 INFO  L134       CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-02-28 20:34:09,072 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031594101] provided 0 perfect and 2 imperfect interpolant sequences
[2024-02-28 20:34:09,072 INFO  L185   FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-02-28 20:34:09,072 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 22, 17] total 49
[2024-02-28 20:34:09,073 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961495151]
[2024-02-28 20:34:09,073 INFO  L85    oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-02-28 20:34:09,073 INFO  L571      AbstractCegarLoop]: INTERPOLANT automaton has 50 states
[2024-02-28 20:34:09,074 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-02-28 20:34:09,075 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants.
[2024-02-28 20:34:09,076 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1675, Unknown=13, NotChecked=534, Total=2450
[2024-02-28 20:34:09,253 INFO  L471   CegarLoopForPetriNet]: Number of universal loopers: 141 out of 249
[2024-02-28 20:34:09,257 INFO  L103   encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 3148 transitions, 56310 flow. Second operand  has 50 states, 50 states have (on average 144.1) internal successors, (7205), 50 states have internal predecessors, (7205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-02-28 20:34:09,257 INFO  L112   encePairwiseOnDemand]: Universal subtrahend loopers provided by user.
[2024-02-28 20:34:09,257 INFO  L113   encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 249
[2024-02-28 20:34:09,257 INFO  L73            FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand
