./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:13:56,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:13:56,386 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DataRace-32bit-Automizer_Default.epf [2023-11-06 21:13:56,392 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:13:56,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:13:56,418 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:13:56,419 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:13:56,419 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:13:56,420 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:13:56,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:13:56,422 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:13:56,422 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:13:56,423 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:13:56,423 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:13:56,424 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:13:56,424 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:13:56,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:13:56,425 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:13:56,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:13:56,427 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:13:56,427 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:13:56,428 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:13:56,429 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2023-11-06 21:13:56,429 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 21:13:56,433 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:13:56,434 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:13:56,434 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:13:56,435 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:13:56,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:13:56,436 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:13:56,436 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:13:56,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:13:56,439 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:13:56,439 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:13:56,440 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:13:56,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:13:56,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:13:56,441 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:13:56,441 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:13:56,441 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:13:56,442 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:13:56,443 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> e280ea7002eb926faba3195da50aa743246f3289123bb9a1b445dc9aaf8e8f3d [2023-11-06 21:13:56,786 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:13:56,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:13:56,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:13:56,822 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:13:56,822 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:13:56,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c [2023-11-06 21:13:59,794 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:14:00,039 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:14:00,040 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/sv-benchmarks/c/weaver/popl20-bad-dot-product-alt.wvr.c [2023-11-06 21:14:00,048 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/data/e20ac35ed/f7a15de6f3ee42e582edf58a838d9ce8/FLAG98ce0060a [2023-11-06 21:14:00,063 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/data/e20ac35ed/f7a15de6f3ee42e582edf58a838d9ce8 [2023-11-06 21:14:00,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:14:00,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:14:00,075 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:00,075 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:14:00,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:14:00,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,082 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116539de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00, skipping insertion in model container [2023-11-06 21:14:00,082 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,129 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:14:00,415 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:00,428 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:14:00,519 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:14:00,538 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:00,539 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 21:14:00,546 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:14:00,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00 WrapperNode [2023-11-06 21:14:00,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:14:00,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:00,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:14:00,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:14:00,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,649 INFO L138 Inliner]: procedures = 28, calls = 75, calls flagged for inlining = 19, calls inlined = 27, statements flattened = 676 [2023-11-06 21:14:00,649 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:14:00,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:14:00,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:14:00,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:14:00,662 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,672 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,748 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,757 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:14:00,765 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:14:00,765 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:14:00,765 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:14:00,766 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (1/1) ... [2023-11-06 21:14:00,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:14:00,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:14:00,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:14:00,939 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:14:00,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:14:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 21:14:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:14:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:14:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:14:00,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 21:14:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 21:14:00,957 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 21:14:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 21:14:00,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 21:14:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 21:14:00,958 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 21:14:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:14:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 21:14:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 21:14:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:14:00,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:14:00,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:14:00,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:14:00,963 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:14:01,128 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:14:01,131 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:14:02,231 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:14:02,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:14:02,770 INFO L302 CfgBuilder]: Removed 7 assume(true) statements. [2023-11-06 21:14:02,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:02 BoogieIcfgContainer [2023-11-06 21:14:02,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:14:02,779 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:14:02,780 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:14:02,783 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:14:02,784 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:14:00" (1/3) ... [2023-11-06 21:14:02,784 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252db6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:02, skipping insertion in model container [2023-11-06 21:14:02,785 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:14:00" (2/3) ... [2023-11-06 21:14:02,787 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@252db6eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:14:02, skipping insertion in model container [2023-11-06 21:14:02,787 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:14:02" (3/3) ... [2023-11-06 21:14:02,789 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-dot-product-alt.wvr.c [2023-11-06 21:14:02,798 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:14:02,809 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:14:02,809 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 87 error locations. [2023-11-06 21:14:02,809 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:14:03,057 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 21:14:03,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 629 places, 655 transitions, 1331 flow [2023-11-06 21:14:03,425 INFO L124 PetriNetUnfolderBase]: 36/652 cut-off events. [2023-11-06 21:14:03,425 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:14:03,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 652 events. 36/652 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2062 event pairs, 0 based on Foata normal form. 0/529 useless extension candidates. Maximal degree in co-relation 499. Up to 2 conditions per place. [2023-11-06 21:14:03,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 629 places, 655 transitions, 1331 flow [2023-11-06 21:14:03,465 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 604 places, 629 transitions, 1276 flow [2023-11-06 21:14:03,470 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:14:03,489 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 604 places, 629 transitions, 1276 flow [2023-11-06 21:14:03,494 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 604 places, 629 transitions, 1276 flow [2023-11-06 21:14:03,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 604 places, 629 transitions, 1276 flow [2023-11-06 21:14:03,746 INFO L124 PetriNetUnfolderBase]: 35/629 cut-off events. [2023-11-06 21:14:03,746 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:14:03,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 642 conditions, 629 events. 35/629 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2062 event pairs, 0 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 499. Up to 2 conditions per place. [2023-11-06 21:14:03,799 INFO L119 LiptonReduction]: Number of co-enabled transitions 70434 [2023-11-06 21:15:26,268 INFO L134 LiptonReduction]: Checked pairs total: 477408 [2023-11-06 21:15:26,268 INFO L136 LiptonReduction]: Total number of compositions: 562 [2023-11-06 21:15:26,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:15:26,292 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=LoopsAndPotentialCycles, 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;@37a7918, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:15:26,293 INFO L358 AbstractCegarLoop]: Starting to check reachability of 151 error locations. [2023-11-06 21:15:26,294 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:15:26,295 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 21:15:26,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 21:15:26,295 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:26,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 21:15:26,297 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:26,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:26,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2814, now seen corresponding path program 1 times [2023-11-06 21:15:26,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:26,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052310867] [2023-11-06 21:15:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:26,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:26,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:26,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:26,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052310867] [2023-11-06 21:15:26,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052310867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:26,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:26,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 21:15:26,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735901059] [2023-11-06 21:15:26,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:26,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 21:15:26,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:26,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 21:15:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 21:15:26,476 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 1217 [2023-11-06 21:15:26,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 251 transitions, 520 flow. Second operand has 2 states, 2 states have (on average 599.5) internal successors, (1199), 2 states have internal predecessors, (1199), 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) [2023-11-06 21:15:26,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:26,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 1217 [2023-11-06 21:15:26,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:32,481 INFO L124 PetriNetUnfolderBase]: 10996/26551 cut-off events. [2023-11-06 21:15:32,482 INFO L125 PetriNetUnfolderBase]: For 578/578 co-relation queries the response was YES. [2023-11-06 21:15:32,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41490 conditions, 26551 events. 10996/26551 cut-off events. For 578/578 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 294712 event pairs, 7645 based on Foata normal form. 1554/22150 useless extension candidates. Maximal degree in co-relation 38075. Up to 14547 conditions per place. [2023-11-06 21:15:32,797 INFO L140 encePairwiseOnDemand]: 1161/1217 looper letters, 58 selfloop transitions, 0 changer transitions 1/195 dead transitions. [2023-11-06 21:15:32,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 195 transitions, 526 flow [2023-11-06 21:15:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 21:15:32,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 21:15:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 1313 transitions. [2023-11-06 21:15:32,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5394412489728841 [2023-11-06 21:15:32,828 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 1313 transitions. [2023-11-06 21:15:32,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 1313 transitions. [2023-11-06 21:15:32,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:32,838 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 1313 transitions. [2023-11-06 21:15:32,848 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 656.5) internal successors, (1313), 2 states have internal predecessors, (1313), 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) [2023-11-06 21:15:32,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 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) [2023-11-06 21:15:32,865 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 1217.0) internal successors, (3651), 3 states have internal predecessors, (3651), 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) [2023-11-06 21:15:32,867 INFO L175 Difference]: Start difference. First operand has 242 places, 251 transitions, 520 flow. Second operand 2 states and 1313 transitions. [2023-11-06 21:15:32,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 195 transitions, 526 flow [2023-11-06 21:15:32,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 195 transitions, 514 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 21:15:32,922 INFO L231 Difference]: Finished difference. Result has 187 places, 194 transitions, 393 flow [2023-11-06 21:15:32,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=393, PETRI_PLACES=187, PETRI_TRANSITIONS=194} [2023-11-06 21:15:32,930 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -55 predicate places. [2023-11-06 21:15:32,930 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 194 transitions, 393 flow [2023-11-06 21:15:32,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 599.5) internal successors, (1199), 2 states have internal predecessors, (1199), 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) [2023-11-06 21:15:32,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:32,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:32,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:15:32,933 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:32,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:32,945 INFO L85 PathProgramCache]: Analyzing trace with hash 116733074, now seen corresponding path program 1 times [2023-11-06 21:15:32,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:32,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469597413] [2023-11-06 21:15:32,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:32,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:33,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:33,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:33,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:33,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469597413] [2023-11-06 21:15:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469597413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:33,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126787505] [2023-11-06 21:15:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:33,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:33,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:33,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 583 out of 1217 [2023-11-06 21:15:33,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 194 transitions, 393 flow. Second operand has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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) [2023-11-06 21:15:33,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:33,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 583 of 1217 [2023-11-06 21:15:33,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:37,164 INFO L124 PetriNetUnfolderBase]: 13301/31341 cut-off events. [2023-11-06 21:15:37,165 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2023-11-06 21:15:37,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49236 conditions, 31341 events. 13301/31341 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 1171. Compared 347371 event pairs, 9727 based on Foata normal form. 0/24441 useless extension candidates. Maximal degree in co-relation 49233. Up to 17759 conditions per place. [2023-11-06 21:15:37,555 INFO L140 encePairwiseOnDemand]: 1214/1217 looper letters, 60 selfloop transitions, 1 changer transitions 0/192 dead transitions. [2023-11-06 21:15:37,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 192 transitions, 511 flow [2023-11-06 21:15:37,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:37,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:37,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1812 transitions. [2023-11-06 21:15:37,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49630238290879214 [2023-11-06 21:15:37,572 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1812 transitions. [2023-11-06 21:15:37,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1812 transitions. [2023-11-06 21:15:37,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:37,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1812 transitions. [2023-11-06 21:15:37,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 604.0) internal successors, (1812), 3 states have internal predecessors, (1812), 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) [2023-11-06 21:15:37,592 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:37,598 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:37,598 INFO L175 Difference]: Start difference. First operand has 187 places, 194 transitions, 393 flow. Second operand 3 states and 1812 transitions. [2023-11-06 21:15:37,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 192 transitions, 511 flow [2023-11-06 21:15:37,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 192 transitions, 511 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:37,619 INFO L231 Difference]: Finished difference. Result has 186 places, 192 transitions, 391 flow [2023-11-06 21:15:37,619 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=186, PETRI_TRANSITIONS=192} [2023-11-06 21:15:37,620 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-11-06 21:15:37,621 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 192 transitions, 391 flow [2023-11-06 21:15:37,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 585.3333333333334) internal successors, (1756), 3 states have internal predecessors, (1756), 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) [2023-11-06 21:15:37,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:37,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:37,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 21:15:37,623 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:37,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1134328517, now seen corresponding path program 1 times [2023-11-06 21:15:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:37,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901377895] [2023-11-06 21:15:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:37,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:37,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:37,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901377895] [2023-11-06 21:15:37,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901377895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:37,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:37,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:37,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570273262] [2023-11-06 21:15:37,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:37,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:37,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:37,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:37,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:37,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 586 out of 1217 [2023-11-06 21:15:37,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 192 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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) [2023-11-06 21:15:37,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:37,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 586 of 1217 [2023-11-06 21:15:37,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:41,475 INFO L124 PetriNetUnfolderBase]: 12347/29066 cut-off events. [2023-11-06 21:15:41,475 INFO L125 PetriNetUnfolderBase]: For 192/192 co-relation queries the response was YES. [2023-11-06 21:15:41,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45682 conditions, 29066 events. 12347/29066 cut-off events. For 192/192 co-relation queries the response was YES. Maximal size of possible extension queue 1123. Compared 320484 event pairs, 8993 based on Foata normal form. 0/23397 useless extension candidates. Maximal degree in co-relation 45678. Up to 16482 conditions per place. [2023-11-06 21:15:41,787 INFO L140 encePairwiseOnDemand]: 1214/1217 looper letters, 59 selfloop transitions, 1 changer transitions 0/190 dead transitions. [2023-11-06 21:15:41,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 190 transitions, 507 flow [2023-11-06 21:15:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:41,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:41,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1820 transitions. [2023-11-06 21:15:41,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4984935634072857 [2023-11-06 21:15:41,801 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1820 transitions. [2023-11-06 21:15:41,801 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1820 transitions. [2023-11-06 21:15:41,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:41,808 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1820 transitions. [2023-11-06 21:15:41,815 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 606.6666666666666) internal successors, (1820), 3 states have internal predecessors, (1820), 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) [2023-11-06 21:15:41,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:41,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:41,832 INFO L175 Difference]: Start difference. First operand has 186 places, 192 transitions, 391 flow. Second operand 3 states and 1820 transitions. [2023-11-06 21:15:41,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 190 transitions, 507 flow [2023-11-06 21:15:41,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 190 transitions, 506 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:41,839 INFO L231 Difference]: Finished difference. Result has 185 places, 190 transitions, 388 flow [2023-11-06 21:15:41,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=388, PETRI_PLACES=185, PETRI_TRANSITIONS=190} [2023-11-06 21:15:41,841 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-11-06 21:15:41,842 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 190 transitions, 388 flow [2023-11-06 21:15:41,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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) [2023-11-06 21:15:41,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:41,844 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:41,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:15:41,850 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:41,851 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:41,851 INFO L85 PathProgramCache]: Analyzing trace with hash 511407081, now seen corresponding path program 1 times [2023-11-06 21:15:41,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:41,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825138087] [2023-11-06 21:15:41,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:41,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:41,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:41,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825138087] [2023-11-06 21:15:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825138087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:41,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 21:15:41,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284590124] [2023-11-06 21:15:41,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:41,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 21:15:41,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:41,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 21:15:41,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 21:15:42,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 1217 [2023-11-06 21:15:42,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 190 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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) [2023-11-06 21:15:42,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:42,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 1217 [2023-11-06 21:15:42,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:47,454 INFO L124 PetriNetUnfolderBase]: 21210/48516 cut-off events. [2023-11-06 21:15:47,454 INFO L125 PetriNetUnfolderBase]: For 268/268 co-relation queries the response was YES. [2023-11-06 21:15:47,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77117 conditions, 48516 events. 21210/48516 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 1750. Compared 556364 event pairs, 8791 based on Foata normal form. 0/39914 useless extension candidates. Maximal degree in co-relation 77113. Up to 28163 conditions per place. [2023-11-06 21:15:47,864 INFO L140 encePairwiseOnDemand]: 1208/1217 looper letters, 82 selfloop transitions, 3 changer transitions 0/202 dead transitions. [2023-11-06 21:15:47,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 202 transitions, 586 flow [2023-11-06 21:15:47,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:15:47,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:15:47,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1831 transitions. [2023-11-06 21:15:47,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015064365927143 [2023-11-06 21:15:47,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 1831 transitions. [2023-11-06 21:15:47,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 1831 transitions. [2023-11-06 21:15:47,876 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:47,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 1831 transitions. [2023-11-06 21:15:47,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 610.3333333333334) internal successors, (1831), 3 states have internal predecessors, (1831), 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) [2023-11-06 21:15:47,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:47,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 1217.0) internal successors, (4868), 4 states have internal predecessors, (4868), 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) [2023-11-06 21:15:47,900 INFO L175 Difference]: Start difference. First operand has 185 places, 190 transitions, 388 flow. Second operand 3 states and 1831 transitions. [2023-11-06 21:15:47,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 202 transitions, 586 flow [2023-11-06 21:15:47,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 202 transitions, 585 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 21:15:47,908 INFO L231 Difference]: Finished difference. Result has 181 places, 187 transitions, 396 flow [2023-11-06 21:15:47,909 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=396, PETRI_PLACES=181, PETRI_TRANSITIONS=187} [2023-11-06 21:15:47,910 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -61 predicate places. [2023-11-06 21:15:47,910 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 187 transitions, 396 flow [2023-11-06 21:15:47,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 582.3333333333334) internal successors, (1747), 3 states have internal predecessors, (1747), 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) [2023-11-06 21:15:47,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:47,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 21:15:47,913 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:47,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:47,914 INFO L85 PathProgramCache]: Analyzing trace with hash -998450295, now seen corresponding path program 1 times [2023-11-06 21:15:47,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:47,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697541454] [2023-11-06 21:15:47,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:47,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:15:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:15:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:15:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:15:48,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697541454] [2023-11-06 21:15:48,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697541454] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:15:48,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:15:48,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:15:48,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650266128] [2023-11-06 21:15:48,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:15:48,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:15:48,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:15:48,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:15:48,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:15:49,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 573 out of 1217 [2023-11-06 21:15:49,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 187 transitions, 396 flow. Second operand has 6 states, 6 states have (on average 575.3333333333334) internal successors, (3452), 6 states have internal predecessors, (3452), 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) [2023-11-06 21:15:49,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:15:49,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 573 of 1217 [2023-11-06 21:15:49,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:15:54,334 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][42], [632#true, 648#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 641#(= |#race~M~0| 0), 548#L104-3true]) [2023-11-06 21:15:54,334 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-11-06 21:15:54,334 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2023-11-06 21:15:54,334 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 21:15:54,335 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-11-06 21:15:54,478 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][42], [632#true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 21#$Ultimate##0true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,478 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-11-06 21:15:54,478 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2023-11-06 21:15:54,478 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 21:15:54,479 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 21:15:54,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][57], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 21#$Ultimate##0true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,479 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 21:15:54,479 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:15:54,479 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 21:15:54,480 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 21:15:54,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][70], [632#true, 297#L105-3true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 651#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 21#$Ultimate##0true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,578 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 21:15:54,578 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:54,578 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:54,578 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:54,790 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][77], [632#true, 214#L105-4true, 652#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 21#$Ultimate##0true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,790 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 21:15:54,791 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:54,791 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:54,791 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:54,874 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][42], [632#true, 205#L72-8true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,874 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 21:15:54,874 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-11-06 21:15:54,874 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:54,875 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:15:54,875 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][57], [632#true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:54,875 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 21:15:54,875 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 21:15:54,875 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:54,876 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:15:55,258 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][70], [632#true, 297#L105-3true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 651#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,258 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,258 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,258 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:55,258 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:55,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), 255#L105-5true, Black: 643#true, 3#L51-1true, 21#$Ultimate##0true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,264 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,265 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:55,265 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,265 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][77], [632#true, 214#L105-4true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 652#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,422 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,422 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:55,422 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:55,422 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,431 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 21#$Ultimate##0true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0), 311#L105-6true]) [2023-11-06 21:15:55,432 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,432 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,432 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:55,432 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][42], [632#true, 308#L73true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,482 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,482 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,482 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:55,482 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:55,482 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][57], [632#true, 308#L73true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,482 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][42], [632#true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 138#thread3EXITtrue, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,483 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:15:55,483 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,484 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:15:55,484 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][57], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 643#true, 3#L51-1true, 138#thread3EXITtrue, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,484 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,484 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:15:55,484 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,484 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:15:55,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), 255#L105-5true, Black: 643#true, 3#L51-1true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,581 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,581 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:15:55,582 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,582 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][70], [632#true, 308#L73true, 297#L105-3true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 651#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,584 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,584 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,584 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,584 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:15:55,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][70], [632#true, 297#L105-3true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 651#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0)), 138#thread3EXITtrue, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,586 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,586 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:15:55,586 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:15:55,586 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:15:55,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][77], [632#true, 214#L105-4true, 308#L73true, 652#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,722 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,722 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,722 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:15:55,722 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,723 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][77], [632#true, 214#L105-4true, 652#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 138#thread3EXITtrue, 3#L51-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:55,723 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,723 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:15:55,723 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,723 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,725 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0), 311#L105-6true]) [2023-11-06 21:15:55,725 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,725 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:15:55,725 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:15:55,725 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:15:56,021 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 308#L73true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), 255#L105-5true, Black: 643#true, 3#L51-1true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:56,021 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 21:15:56,021 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:15:56,022 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 21:15:56,022 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 21:15:56,023 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 255#L105-5true, 3#L51-1true, 138#thread3EXITtrue, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0)]) [2023-11-06 21:15:56,024 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 21:15:56,024 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 21:15:56,024 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:15:56,024 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 21:15:56,229 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 308#L73true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0), 311#L105-6true]) [2023-11-06 21:15:56,229 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 21:15:56,229 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:15:56,229 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-06 21:15:56,229 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:15:56,231 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][92], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 138#thread3EXITtrue, 653#(and (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ |ULTIMATE.start_main_~#t1~0#1.offset| 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 2 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) (+ 3 |ULTIMATE.start_main_~#t1~0#1.offset|)) 0)), 641#(= |#race~M~0| 0), 311#L105-6true]) [2023-11-06 21:15:56,231 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2023-11-06 21:15:56,231 INFO L297 olderBase$Statistics]: existing Event has 48 ancestors and is cut-off event [2023-11-06 21:15:56,231 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-11-06 21:15:56,231 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:15:59,302 INFO L124 PetriNetUnfolderBase]: 39245/57658 cut-off events. [2023-11-06 21:15:59,302 INFO L125 PetriNetUnfolderBase]: For 2389/2389 co-relation queries the response was YES. [2023-11-06 21:15:59,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110785 conditions, 57658 events. 39245/57658 cut-off events. For 2389/2389 co-relation queries the response was YES. Maximal size of possible extension queue 2147. Compared 461115 event pairs, 3059 based on Foata normal form. 0/44067 useless extension candidates. Maximal degree in co-relation 110781. Up to 18060 conditions per place. [2023-11-06 21:15:59,880 INFO L140 encePairwiseOnDemand]: 1212/1217 looper letters, 219 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2023-11-06 21:15:59,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 346 transitions, 1180 flow [2023-11-06 21:15:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:15:59,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:15:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3657 transitions. [2023-11-06 21:15:59,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008216926869351 [2023-11-06 21:15:59,897 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3657 transitions. [2023-11-06 21:15:59,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3657 transitions. [2023-11-06 21:15:59,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:15:59,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3657 transitions. [2023-11-06 21:15:59,920 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 609.5) internal successors, (3657), 6 states have internal predecessors, (3657), 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) [2023-11-06 21:15:59,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1217.0) internal successors, (8519), 7 states have internal predecessors, (8519), 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) [2023-11-06 21:15:59,942 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1217.0) internal successors, (8519), 7 states have internal predecessors, (8519), 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) [2023-11-06 21:15:59,942 INFO L175 Difference]: Start difference. First operand has 181 places, 187 transitions, 396 flow. Second operand 6 states and 3657 transitions. [2023-11-06 21:15:59,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 346 transitions, 1180 flow [2023-11-06 21:15:59,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 346 transitions, 1180 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 21:15:59,952 INFO L231 Difference]: Finished difference. Result has 185 places, 186 transitions, 402 flow [2023-11-06 21:15:59,953 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=402, PETRI_PLACES=185, PETRI_TRANSITIONS=186} [2023-11-06 21:15:59,955 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -57 predicate places. [2023-11-06 21:15:59,956 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 186 transitions, 402 flow [2023-11-06 21:15:59,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 575.3333333333334) internal successors, (3452), 6 states have internal predecessors, (3452), 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) [2023-11-06 21:15:59,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:15:59,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:15:59,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:15:59,975 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:15:59,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:15:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1390220589, now seen corresponding path program 1 times [2023-11-06 21:15:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:15:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324340024] [2023-11-06 21:15:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:15:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:00,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:00,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:16:00,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:00,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324340024] [2023-11-06 21:16:00,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324340024] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:00,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 21:16:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352909735] [2023-11-06 21:16:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:00,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 21:16:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:00,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 21:16:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 21:16:00,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1217 [2023-11-06 21:16:00,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 186 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 580.5) internal successors, (2322), 4 states have internal predecessors, (2322), 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) [2023-11-06 21:16:00,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:00,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1217 [2023-11-06 21:16:00,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:02,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 648#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 655#true, 641#(= |#race~M~0| 0), 548#L104-3true]) [2023-11-06 21:16:02,098 INFO L294 olderBase$Statistics]: this new event has 40 ancestors and is cut-off event [2023-11-06 21:16:02,099 INFO L297 olderBase$Statistics]: existing Event has 18 ancestors and is cut-off event [2023-11-06 21:16:02,099 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 21:16:02,099 INFO L297 olderBase$Statistics]: existing Event has 40 ancestors and is cut-off event [2023-11-06 21:16:02,192 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 655#true, 3#L51-1true, 21#$Ultimate##0true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,192 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-11-06 21:16:02,192 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:16:02,193 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-06 21:16:02,193 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:16:02,288 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 643#true, 3#L51-1true, 655#true, 21#$Ultimate##0true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,288 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-11-06 21:16:02,288 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:16:02,288 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-06 21:16:02,288 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:16:02,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 648#true, 205#L72-8true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 655#true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,401 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,402 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:16:02,402 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,402 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:16:02,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 645#(= |#race~A~0| 0), 637#(= |#race~N~0| 0), 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), Black: 643#true, 3#L51-1true, 655#true, 100#$Ultimate##0true, 46#L105-2true, 109#L73-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,403 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,403 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,403 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-06 21:16:02,403 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-11-06 21:16:02,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 205#L72-8true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,472 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-11-06 21:16:02,473 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-06 21:16:02,473 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:16:02,473 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-11-06 21:16:02,767 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 308#L73true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 655#true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,767 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 21:16:02,767 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:16:02,767 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,768 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:16:02,768 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 648#true, 172#L104-4true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 3#L51-1true, 655#true, 138#thread3EXITtrue, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,768 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-11-06 21:16:02,768 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-11-06 21:16:02,768 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-11-06 21:16:02,768 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 308#L73true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,847 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 46#L105-2true, 109#L73-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,847 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2023-11-06 21:16:02,847 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 645#(= |#race~A~0| 0), 37#L62-1true, 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 138#thread3EXITtrue, 46#L105-2true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,848 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:16:02,848 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 194#L62true, 645#(= |#race~A~0| 0), 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 46#L105-2true, 109#L73-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,849 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2250] L50-2-->L51-1: Formula: (and (< |v_thread1Thread1of1ForFork0_~i~0#1_81| v_~N~0_12) (= |v_#race~A~0_151| 0)) InVars {thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12} OutVars{thread1Thread1of1ForFork0_~i~0#1=|v_thread1Thread1of1ForFork0_~i~0#1_81|, ~N~0=v_~N~0_12, #race~A~0=|v_#race~A~0_151|} AuxVars[] AssignedVars[#race~A~0][40], [632#true, 156#thread2EXITtrue, 645#(= |#race~A~0| 0), 637#(= |#race~N~0| 0), Black: 643#true, 650#(= (select (select |#race| |ULTIMATE.start_main_~#t1~0#1.base|) |ULTIMATE.start_main_~#t1~0#1.offset|) 0), 3#L51-1true, 655#true, 46#L105-2true, 109#L73-1true, 641#(= |#race~M~0| 0)]) [2023-11-06 21:16:02,849 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-11-06 21:16:02,849 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-11-06 21:16:02,850 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-11-06 21:16:04,591 INFO L124 PetriNetUnfolderBase]: 12846/29717 cut-off events. [2023-11-06 21:16:04,591 INFO L125 PetriNetUnfolderBase]: For 2740/2740 co-relation queries the response was YES. [2023-11-06 21:16:04,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50027 conditions, 29717 events. 12846/29717 cut-off events. For 2740/2740 co-relation queries the response was YES. Maximal size of possible extension queue 1185. Compared 326452 event pairs, 8132 based on Foata normal form. 0/23390 useless extension candidates. Maximal degree in co-relation 50022. Up to 16969 conditions per place. [2023-11-06 21:16:04,846 INFO L140 encePairwiseOnDemand]: 1211/1217 looper letters, 57 selfloop transitions, 4 changer transitions 6/194 dead transitions. [2023-11-06 21:16:04,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 194 transitions, 552 flow [2023-11-06 21:16:04,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:16:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:16:04,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2963 transitions. [2023-11-06 21:16:04,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48693508627773213 [2023-11-06 21:16:04,861 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 2963 transitions. [2023-11-06 21:16:04,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 2963 transitions. [2023-11-06 21:16:04,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:04,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 2963 transitions. [2023-11-06 21:16:04,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 592.6) internal successors, (2963), 5 states have internal predecessors, (2963), 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) [2023-11-06 21:16:04,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 1217.0) internal successors, (7302), 6 states have internal predecessors, (7302), 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) [2023-11-06 21:16:04,890 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 1217.0) internal successors, (7302), 6 states have internal predecessors, (7302), 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) [2023-11-06 21:16:04,890 INFO L175 Difference]: Start difference. First operand has 185 places, 186 transitions, 402 flow. Second operand 5 states and 2963 transitions. [2023-11-06 21:16:04,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 194 transitions, 552 flow [2023-11-06 21:16:04,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 194 transitions, 545 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 21:16:04,931 INFO L231 Difference]: Finished difference. Result has 188 places, 188 transitions, 423 flow [2023-11-06 21:16:04,932 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=423, PETRI_PLACES=188, PETRI_TRANSITIONS=188} [2023-11-06 21:16:04,935 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -54 predicate places. [2023-11-06 21:16:04,935 INFO L495 AbstractCegarLoop]: Abstraction has has 188 places, 188 transitions, 423 flow [2023-11-06 21:16:04,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 580.5) internal successors, (2322), 4 states have internal predecessors, (2322), 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) [2023-11-06 21:16:04,937 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:04,937 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:16:04,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 21:16:04,938 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:16:04,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:04,938 INFO L85 PathProgramCache]: Analyzing trace with hash -847461558, now seen corresponding path program 1 times [2023-11-06 21:16:04,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:04,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479507332] [2023-11-06 21:16:04,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:04,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:04,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:05,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:16:05,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:05,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479507332] [2023-11-06 21:16:05,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479507332] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:16:05,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:16:05,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 21:16:05,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821611748] [2023-11-06 21:16:05,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:16:05,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:16:05,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:05,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:16:05,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:16:06,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 1217 [2023-11-06 21:16:06,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 188 transitions, 423 flow. Second operand has 6 states, 6 states have (on average 568.3333333333334) internal successors, (3410), 6 states have internal predecessors, (3410), 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) [2023-11-06 21:16:06,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:06,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 1217 [2023-11-06 21:16:06,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:16:14,288 INFO L124 PetriNetUnfolderBase]: 22177/44093 cut-off events. [2023-11-06 21:16:14,289 INFO L125 PetriNetUnfolderBase]: For 632/632 co-relation queries the response was YES. [2023-11-06 21:16:14,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74740 conditions, 44093 events. 22177/44093 cut-off events. For 632/632 co-relation queries the response was YES. Maximal size of possible extension queue 1682. Compared 459309 event pairs, 3331 based on Foata normal form. 0/36195 useless extension candidates. Maximal degree in co-relation 74732. Up to 18156 conditions per place. [2023-11-06 21:16:14,553 INFO L140 encePairwiseOnDemand]: 1210/1217 looper letters, 198 selfloop transitions, 5 changer transitions 0/318 dead transitions. [2023-11-06 21:16:14,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 318 transitions, 1097 flow [2023-11-06 21:16:14,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:16:14,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:16:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3598 transitions. [2023-11-06 21:16:14,568 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49274171459874005 [2023-11-06 21:16:14,568 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 3598 transitions. [2023-11-06 21:16:14,568 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 3598 transitions. [2023-11-06 21:16:14,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:16:14,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 3598 transitions. [2023-11-06 21:16:14,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 599.6666666666666) internal successors, (3598), 6 states have internal predecessors, (3598), 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) [2023-11-06 21:16:14,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 1217.0) internal successors, (8519), 7 states have internal predecessors, (8519), 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) [2023-11-06 21:16:14,599 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 1217.0) internal successors, (8519), 7 states have internal predecessors, (8519), 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) [2023-11-06 21:16:14,599 INFO L175 Difference]: Start difference. First operand has 188 places, 188 transitions, 423 flow. Second operand 6 states and 3598 transitions. [2023-11-06 21:16:14,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 318 transitions, 1097 flow [2023-11-06 21:16:14,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 318 transitions, 1087 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-06 21:16:14,608 INFO L231 Difference]: Finished difference. Result has 186 places, 186 transitions, 419 flow [2023-11-06 21:16:14,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=1217, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=419, PETRI_PLACES=186, PETRI_TRANSITIONS=186} [2023-11-06 21:16:14,609 INFO L281 CegarLoopForPetriNet]: 242 programPoint places, -56 predicate places. [2023-11-06 21:16:14,609 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 186 transitions, 419 flow [2023-11-06 21:16:14,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 568.3333333333334) internal successors, (3410), 6 states have internal predecessors, (3410), 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) [2023-11-06 21:16:14,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:16:14,611 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] [2023-11-06 21:16:14,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 21:16:14,611 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 147 more)] === [2023-11-06 21:16:14,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:16:14,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1815409911, now seen corresponding path program 1 times [2023-11-06 21:16:14,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:16:14,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374813405] [2023-11-06 21:16:14,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:14,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:16:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:14,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:14,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:16:14,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374813405] [2023-11-06 21:16:14,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374813405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:16:14,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146553246] [2023-11-06 21:16:14,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:16:14,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:16:14,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:16:14,876 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:16:14,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a94e6631-3c07-46ab-aa56-8c2e6e64fde5/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:16:15,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:16:15,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:16:15,069 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:16:15,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:15,168 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:16:15,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:16:15,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146553246] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:16:15,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:16:15,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-11-06 21:16:15,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57888256] [2023-11-06 21:16:15,244 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:16:15,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:16:15,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:16:15,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:16:15,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:16:16,617 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 566 out of 1217 [2023-11-06 21:16:16,623 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 186 transitions, 419 flow. Second operand has 13 states, 13 states have (on average 567.6153846153846) internal successors, (7379), 13 states have internal predecessors, (7379), 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) [2023-11-06 21:16:16,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:16:16,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 566 of 1217 [2023-11-06 21:16:16,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand