./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-24 01:37:25,424 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:37:25,510 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-24 01:37:25,519 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:37:25,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:37:25,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:37:25,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:37:25,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:37:25,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:37:25,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:37:25,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:37:25,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:37:25,562 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:37:25,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:37:25,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:37:25,563 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:37:25,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:37:25,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-24 01:37:25,564 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:37:25,565 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:37:25,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:37:25,566 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:37:25,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:37:25,566 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:37:25,566 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:37:25,566 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:37:25,567 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:37:25,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:37:25,568 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c1d27b7f98ac68d2da6120346c107c87df7f6f708200f0d5d2c806741122116e [2024-11-24 01:37:25,879 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:37:25,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:37:25,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:37:25,895 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:37:25,896 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:37:25,897 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-24 01:37:28,793 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/data/1b456e6ec/6a121143ead34ece824b265e322c5e58/FLAG37209b85d [2024-11-24 01:37:29,061 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:37:29,062 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-24 01:37:29,078 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/data/1b456e6ec/6a121143ead34ece824b265e322c5e58/FLAG37209b85d [2024-11-24 01:37:29,103 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/data/1b456e6ec/6a121143ead34ece824b265e322c5e58 [2024-11-24 01:37:29,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:37:29,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:37:29,111 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:37:29,111 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:37:29,121 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:37:29,122 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7275c43b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29, skipping insertion in model container [2024-11-24 01:37:29,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,150 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:37:29,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:37:29,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:37:29,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:37:29,470 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:37:29,471 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29 WrapperNode [2024-11-24 01:37:29,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:37:29,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:37:29,473 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:37:29,473 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:37:29,480 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,527 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 186 [2024-11-24 01:37:29,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:37:29,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:37:29,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:37:29,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:37:29,538 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,539 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,544 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,545 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,564 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,566 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:37:29,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:37:29,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:37:29,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:37:29,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (1/1) ... [2024-11-24 01:37:29,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:37:29,596 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:37:29,619 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:37:29,622 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:37:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:37:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-24 01:37:29,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-24 01:37:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-24 01:37:29,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-24 01:37:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-24 01:37:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-24 01:37:29,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:37:29,648 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:37:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-24 01:37:29,650 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-24 01:37:29,769 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:37:29,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:37:30,665 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-24 01:37:30,665 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:37:30,928 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:37:30,928 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-24 01:37:30,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:37:30 BoogieIcfgContainer [2024-11-24 01:37:30,929 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:37:30,935 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:37:30,935 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:37:30,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:37:30,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:37:29" (1/3) ... [2024-11-24 01:37:30,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d4d4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:37:30, skipping insertion in model container [2024-11-24 01:37:30,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:37:29" (2/3) ... [2024-11-24 01:37:30,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76d4d4e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:37:30, skipping insertion in model container [2024-11-24 01:37:30,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:37:30" (3/3) ... [2024-11-24 01:37:30,963 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-24 01:37:30,988 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:37:30,990 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-three-array-sum.wvr.c that has 4 procedures, 325 locations, 1 initial locations, 6 loop locations, and 36 error locations. [2024-11-24 01:37:30,991 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-24 01:37:31,150 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-24 01:37:31,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 709 flow [2024-11-24 01:37:31,417 INFO L124 PetriNetUnfolderBase]: 20/341 cut-off events. [2024-11-24 01:37:31,419 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-24 01:37:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 341 events. 20/341 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 461 event pairs, 0 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 291. Up to 2 conditions per place. [2024-11-24 01:37:31,433 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 709 flow [2024-11-24 01:37:31,440 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 324 transitions, 666 flow [2024-11-24 01:37:31,449 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:37:31,468 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7067ad20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:37:31,468 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-24 01:37:31,481 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-24 01:37:31,481 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-24 01:37:31,481 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-24 01:37:31,481 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:31,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:31,484 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:31,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:31,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1514911445, now seen corresponding path program 1 times [2024-11-24 01:37:31,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:31,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826779169] [2024-11-24 01:37:31,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:31,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:31,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:31,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:31,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:31,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826779169] [2024-11-24 01:37:31,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826779169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:31,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:31,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:31,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816022332] [2024-11-24 01:37:31,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:31,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:31,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:31,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:31,851 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 344 [2024-11-24 01:37:31,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 324 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:31,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:31,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 344 [2024-11-24 01:37:31,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:32,269 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2024-11-24 01:37:32,270 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-24 01:37:32,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 884 events. 85/884 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4495 event pairs, 51 based on Foata normal form. 9/749 useless extension candidates. Maximal degree in co-relation 759. Up to 134 conditions per place. [2024-11-24 01:37:32,285 INFO L140 encePairwiseOnDemand]: 317/344 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2024-11-24 01:37:32,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2024-11-24 01:37:32,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:32,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-24 01:37:32,310 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9040697674418605 [2024-11-24 01:37:32,315 INFO L175 Difference]: Start difference. First operand has 315 places, 324 transitions, 666 flow. Second operand 3 states and 933 transitions. [2024-11-24 01:37:32,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2024-11-24 01:37:32,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-24 01:37:32,334 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2024-11-24 01:37:32,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=596, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2024-11-24 01:37:32,343 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2024-11-24 01:37:32,343 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2024-11-24 01:37:32,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.3333333333333) internal successors, (892), 3 states have internal predecessors, (892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:32,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:32,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:32,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-24 01:37:32,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:32,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:32,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1274509642, now seen corresponding path program 1 times [2024-11-24 01:37:32,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179998221] [2024-11-24 01:37:32,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:32,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:32,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179998221] [2024-11-24 01:37:32,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179998221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:32,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:32,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:32,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621175671] [2024-11-24 01:37:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:32,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:32,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:32,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:32,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:32,495 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 344 [2024-11-24 01:37:32,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 596 flow. Second operand has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:32,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:32,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 344 [2024-11-24 01:37:32,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:32,821 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2024-11-24 01:37:32,821 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-24 01:37:32,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1314 conditions, 995 events. 213/995 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 5272 event pairs, 128 based on Foata normal form. 0/858 useless extension candidates. Maximal degree in co-relation 1281. Up to 297 conditions per place. [2024-11-24 01:37:32,830 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2024-11-24 01:37:32,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2024-11-24 01:37:32,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:32,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:32,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-11-24 01:37:32,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701550387596899 [2024-11-24 01:37:32,835 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2024-11-24 01:37:32,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2024-11-24 01:37:32,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:32,845 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2024-11-24 01:37:32,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=284, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=286, PETRI_TRANSITIONS=287} [2024-11-24 01:37:32,848 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2024-11-24 01:37:32,848 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2024-11-24 01:37:32,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:32,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:32,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:32,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:37:32,850 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:32,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:32,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1344509392, now seen corresponding path program 1 times [2024-11-24 01:37:32,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:32,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674808082] [2024-11-24 01:37:32,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:32,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:33,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:33,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674808082] [2024-11-24 01:37:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674808082] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:33,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:33,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:37:33,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482150961] [2024-11-24 01:37:33,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:33,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:37:33,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:33,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:37:33,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:37:34,232 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 344 [2024-11-24 01:37:34,235 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 287 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:34,235 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:34,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 344 [2024-11-24 01:37:34,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:34,589 INFO L124 PetriNetUnfolderBase]: 128/873 cut-off events. [2024-11-24 01:37:34,589 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-24 01:37:34,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1149 conditions, 873 events. 128/873 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4254 event pairs, 100 based on Foata normal form. 0/759 useless extension candidates. Maximal degree in co-relation 1117. Up to 230 conditions per place. [2024-11-24 01:37:34,597 INFO L140 encePairwiseOnDemand]: 326/344 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2024-11-24 01:37:34,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2024-11-24 01:37:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:37:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 01:37:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2024-11-24 01:37:34,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814922480620154 [2024-11-24 01:37:34,605 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2024-11-24 01:37:34,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2024-11-24 01:37:34,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 01:37:34,611 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2024-11-24 01:37:34,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=605, PETRI_PLACES=287, PETRI_TRANSITIONS=284} [2024-11-24 01:37:34,613 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2024-11-24 01:37:34,613 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2024-11-24 01:37:34,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:34,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:34,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:34,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:37:34,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:34,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:34,617 INFO L85 PathProgramCache]: Analyzing trace with hash -482287339, now seen corresponding path program 1 times [2024-11-24 01:37:34,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:34,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566889292] [2024-11-24 01:37:34,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:34,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:34,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:34,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566889292] [2024-11-24 01:37:34,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566889292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:34,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:34,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:34,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141345453] [2024-11-24 01:37:34,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:34,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:34,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:34,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:34,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:34,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-24 01:37:34,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 284 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:34,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:34,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-24 01:37:34,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:34,819 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2024-11-24 01:37:34,819 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-24 01:37:34,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 389 events. 37/389 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1084 event pairs, 23 based on Foata normal form. 0/362 useless extension candidates. Maximal degree in co-relation 438. Up to 55 conditions per place. [2024-11-24 01:37:34,824 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-24 01:37:34,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2024-11-24 01:37:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:34,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-24 01:37:34,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-24 01:37:34,828 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2024-11-24 01:37:34,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2024-11-24 01:37:34,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-24 01:37:34,835 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2024-11-24 01:37:34,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=281, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=283, PETRI_TRANSITIONS=283} [2024-11-24 01:37:34,837 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-24 01:37:34,838 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2024-11-24 01:37:34,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:34,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:34,839 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:34,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:37:34,840 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:34,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:34,840 INFO L85 PathProgramCache]: Analyzing trace with hash -187453708, now seen corresponding path program 1 times [2024-11-24 01:37:34,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:34,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730063180] [2024-11-24 01:37:34,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:34,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:34,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730063180] [2024-11-24 01:37:34,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730063180] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:34,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:34,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:34,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89650913] [2024-11-24 01:37:34,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:34,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:34,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:34,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:34,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:34,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-24 01:37:34,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 283 transitions, 577 flow. Second operand has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:34,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:34,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-24 01:37:34,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:35,118 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2024-11-24 01:37:35,118 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-24 01:37:35,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 388 events. 37/388 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1058 event pairs, 23 based on Foata normal form. 0/357 useless extension candidates. Maximal degree in co-relation 424. Up to 55 conditions per place. [2024-11-24 01:37:35,121 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-24 01:37:35,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2024-11-24 01:37:35,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:35,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:35,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-24 01:37:35,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-24 01:37:35,125 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2024-11-24 01:37:35,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2024-11-24 01:37:35,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:35,130 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2024-11-24 01:37:35,131 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=571, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=575, PETRI_PLACES=282, PETRI_TRANSITIONS=282} [2024-11-24 01:37:35,133 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-24 01:37:35,133 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2024-11-24 01:37:35,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 302.3333333333333) internal successors, (907), 3 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:35,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:35,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-24 01:37:35,135 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:35,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:35,136 INFO L85 PathProgramCache]: Analyzing trace with hash 479767889, now seen corresponding path program 1 times [2024-11-24 01:37:35,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:35,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140856] [2024-11-24 01:37:35,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:35,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:35,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:35,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:35,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140856] [2024-11-24 01:37:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318920210] [2024-11-24 01:37:35,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:35,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:35,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:35,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:35,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:35,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-24 01:37:35,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 282 transitions, 575 flow. Second operand has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:35,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-24 01:37:35,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:35,375 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2024-11-24 01:37:35,375 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-24 01:37:35,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 319 events. 21/319 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 592 event pairs, 12 based on Foata normal form. 0/300 useless extension candidates. Maximal degree in co-relation 332. Up to 35 conditions per place. [2024-11-24 01:37:35,379 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-24 01:37:35,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2024-11-24 01:37:35,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:35,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-11-24 01:37:35,383 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8924418604651163 [2024-11-24 01:37:35,383 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2024-11-24 01:37:35,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2024-11-24 01:37:35,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:35,388 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2024-11-24 01:37:35,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=281, PETRI_TRANSITIONS=281} [2024-11-24 01:37:35,389 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2024-11-24 01:37:35,389 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2024-11-24 01:37:35,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.3333333333333) internal successors, (910), 3 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:35,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:35,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:37:35,392 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:35,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash 119216684, now seen corresponding path program 1 times [2024-11-24 01:37:35,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:35,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685961439] [2024-11-24 01:37:35,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:35,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:35,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:35,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:35,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:35,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685961439] [2024-11-24 01:37:35,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685961439] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:35,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:35,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:35,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875907169] [2024-11-24 01:37:35,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:35,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:35,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:35,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:35,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:35,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-24 01:37:35,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 281 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:35,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-24 01:37:35,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:35,729 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2024-11-24 01:37:35,729 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-24 01:37:35,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 670 events. 70/670 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2781 event pairs, 23 based on Foata normal form. 0/600 useless extension candidates. Maximal degree in co-relation 764. Up to 58 conditions per place. [2024-11-24 01:37:35,734 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2024-11-24 01:37:35,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2024-11-24 01:37:35,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-11-24 01:37:35,736 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982558139534884 [2024-11-24 01:37:35,737 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2024-11-24 01:37:35,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2024-11-24 01:37:35,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:35,742 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2024-11-24 01:37:35,743 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=279, PETRI_TRANSITIONS=279} [2024-11-24 01:37:35,745 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-24 01:37:35,745 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2024-11-24 01:37:35,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.0) internal successors, (909), 3 states have internal predecessors, (909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:35,746 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:35,746 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:37:35,746 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:35,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:35,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1396853202, now seen corresponding path program 1 times [2024-11-24 01:37:35,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:35,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43020904] [2024-11-24 01:37:35,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:35,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:35,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:35,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:35,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43020904] [2024-11-24 01:37:35,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43020904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:35,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:35,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:35,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637014269] [2024-11-24 01:37:35,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:35,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:35,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:35,834 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:35,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:35,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-24 01:37:35,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 279 transitions, 571 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:35,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:35,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-24 01:37:35,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:36,068 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2024-11-24 01:37:36,068 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-24 01:37:36,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 910 conditions, 765 events. 76/765 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3524 event pairs, 8 based on Foata normal form. 0/692 useless extension candidates. Maximal degree in co-relation 878. Up to 99 conditions per place. [2024-11-24 01:37:36,073 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-24 01:37:36,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2024-11-24 01:37:36,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:36,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-24 01:37:36,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079457364341085 [2024-11-24 01:37:36,079 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2024-11-24 01:37:36,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2024-11-24 01:37:36,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:36,090 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2024-11-24 01:37:36,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=276, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=577, PETRI_PLACES=279, PETRI_TRANSITIONS=280} [2024-11-24 01:37:36,093 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-24 01:37:36,093 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2024-11-24 01:37:36,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:36,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:36,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:36,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:37:36,096 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:36,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:36,096 INFO L85 PathProgramCache]: Analyzing trace with hash 780223954, now seen corresponding path program 1 times [2024-11-24 01:37:36,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:36,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264662016] [2024-11-24 01:37:36,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:36,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:36,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:36,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:36,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:36,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264662016] [2024-11-24 01:37:36,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264662016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:36,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:36,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:37:36,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37198791] [2024-11-24 01:37:36,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:36,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:37:36,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:36,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:37:36,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:37:36,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 344 [2024-11-24 01:37:36,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 280 transitions, 577 flow. Second operand has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:36,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:36,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 344 [2024-11-24 01:37:36,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:37,651 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2024-11-24 01:37:37,651 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-24 01:37:37,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1782 conditions, 1252 events. 202/1252 cut-off events. For 110/110 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 5654 event pairs, 96 based on Foata normal form. 9/1180 useless extension candidates. Maximal degree in co-relation 1748. Up to 201 conditions per place. [2024-11-24 01:37:37,659 INFO L140 encePairwiseOnDemand]: 315/344 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2024-11-24 01:37:37,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2024-11-24 01:37:37,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:37:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-24 01:37:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2024-11-24 01:37:37,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8290697674418605 [2024-11-24 01:37:37,665 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2024-11-24 01:37:37,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2024-11-24 01:37:37,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 01:37:37,671 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2024-11-24 01:37:37,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=769, PETRI_PLACES=292, PETRI_TRANSITIONS=305} [2024-11-24 01:37:37,672 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-24 01:37:37,672 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2024-11-24 01:37:37,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 280.14285714285717) internal successors, (1961), 7 states have internal predecessors, (1961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:37,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:37,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:37,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:37:37,674 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:37,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:37,675 INFO L85 PathProgramCache]: Analyzing trace with hash -89260748, now seen corresponding path program 1 times [2024-11-24 01:37:37,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:37,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890597873] [2024-11-24 01:37:37,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:37,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:37,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890597873] [2024-11-24 01:37:37,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890597873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:37,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:37,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:37,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042862387] [2024-11-24 01:37:37,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:37,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:37,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:37,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:37,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:37,751 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2024-11-24 01:37:37,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 305 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:37,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:37,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2024-11-24 01:37:37,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:37,921 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2024-11-24 01:37:37,922 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2024-11-24 01:37:37,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1077 conditions, 783 events. 90/783 cut-off events. For 77/80 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2586 event pairs, 32 based on Foata normal form. 0/739 useless extension candidates. Maximal degree in co-relation 1037. Up to 120 conditions per place. [2024-11-24 01:37:37,927 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2024-11-24 01:37:37,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2024-11-24 01:37:37,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:37,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2024-11-24 01:37:37,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2024-11-24 01:37:37,930 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2024-11-24 01:37:37,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2024-11-24 01:37:37,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 01:37:37,949 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2024-11-24 01:37:37,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=293, PETRI_TRANSITIONS=304} [2024-11-24 01:37:37,950 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-24 01:37:37,950 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2024-11-24 01:37:37,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 308.6666666666667) internal successors, (926), 3 states have internal predecessors, (926), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:37,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:37,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:37,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:37:37,951 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:37,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:37,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1976094477, now seen corresponding path program 1 times [2024-11-24 01:37:37,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:37,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97945713] [2024-11-24 01:37:37,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:37,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-24 01:37:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97945713] [2024-11-24 01:37:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97945713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:38,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:38,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:38,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558394985] [2024-11-24 01:37:38,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:38,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:38,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:38,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:38,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:38,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-24 01:37:38,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 304 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:38,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:38,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-24 01:37:38,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:38,291 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2024-11-24 01:37:38,291 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2024-11-24 01:37:38,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1367 conditions, 970 events. 136/970 cut-off events. For 98/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3923 event pairs, 39 based on Foata normal form. 4/916 useless extension candidates. Maximal degree in co-relation 1330. Up to 141 conditions per place. [2024-11-24 01:37:38,297 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2024-11-24 01:37:38,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2024-11-24 01:37:38,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:38,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:38,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-24 01:37:38,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972868217054264 [2024-11-24 01:37:38,300 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2024-11-24 01:37:38,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2024-11-24 01:37:38,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-24 01:37:38,306 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2024-11-24 01:37:38,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=292, PETRI_TRANSITIONS=274} [2024-11-24 01:37:38,307 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-24 01:37:38,307 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2024-11-24 01:37:38,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 304.6666666666667) internal successors, (914), 3 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:38,308 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:38,308 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:37:38,308 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2016087182, now seen corresponding path program 1 times [2024-11-24 01:37:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385129604] [2024-11-24 01:37:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:38,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:39,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385129604] [2024-11-24 01:37:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385129604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:39,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:37:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016985957] [2024-11-24 01:37:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:39,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:37:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:39,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:37:39,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:37:39,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-24 01:37:39,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 274 transitions, 644 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:39,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:39,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-24 01:37:39,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:40,170 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2024-11-24 01:37:40,170 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2024-11-24 01:37:40,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1287 events. 231/1287 cut-off events. For 159/166 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 7366 event pairs, 74 based on Foata normal form. 0/1197 useless extension candidates. Maximal degree in co-relation 1900. Up to 282 conditions per place. [2024-11-24 01:37:40,178 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2024-11-24 01:37:40,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2024-11-24 01:37:40,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:37:40,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 01:37:40,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-24 01:37:40,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-24 01:37:40,183 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2024-11-24 01:37:40,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2024-11-24 01:37:40,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-11-24 01:37:40,189 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2024-11-24 01:37:40,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=668, PETRI_PLACES=282, PETRI_TRANSITIONS=283} [2024-11-24 01:37:40,190 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-24 01:37:40,190 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2024-11-24 01:37:40,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:40,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:40,191 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:37:40,191 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:40,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:40,192 INFO L85 PathProgramCache]: Analyzing trace with hash -433205515, now seen corresponding path program 1 times [2024-11-24 01:37:40,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314943575] [2024-11-24 01:37:40,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:40,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:40,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314943575] [2024-11-24 01:37:40,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314943575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:40,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:40,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:40,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101429595] [2024-11-24 01:37:40,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:40,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:40,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:40,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:40,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:40,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-24 01:37:40,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 283 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:40,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:40,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-24 01:37:40,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:40,661 INFO L124 PetriNetUnfolderBase]: 255/1345 cut-off events. [2024-11-24 01:37:40,661 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2024-11-24 01:37:40,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2254 conditions, 1345 events. 255/1345 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7881 event pairs, 84 based on Foata normal form. 0/1259 useless extension candidates. Maximal degree in co-relation 2216. Up to 265 conditions per place. [2024-11-24 01:37:40,671 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-24 01:37:40,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2024-11-24 01:37:40,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-24 01:37:40,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-24 01:37:40,674 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2024-11-24 01:37:40,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2024-11-24 01:37:40,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-24 01:37:40,681 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2024-11-24 01:37:40,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=283, PETRI_TRANSITIONS=282} [2024-11-24 01:37:40,682 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-24 01:37:40,682 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2024-11-24 01:37:40,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:40,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:40,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:40,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:37:40,684 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:40,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:40,685 INFO L85 PathProgramCache]: Analyzing trace with hash 1570788794, now seen corresponding path program 1 times [2024-11-24 01:37:40,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:40,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334335991] [2024-11-24 01:37:40,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:40,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:40,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:40,798 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:40,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:40,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334335991] [2024-11-24 01:37:40,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334335991] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:40,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:40,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:40,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121731130] [2024-11-24 01:37:40,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:40,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:40,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:40,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:40,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:40,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-24 01:37:40,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:40,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:40,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-24 01:37:40,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:41,084 INFO L124 PetriNetUnfolderBase]: 187/1151 cut-off events. [2024-11-24 01:37:41,084 INFO L125 PetriNetUnfolderBase]: For 405/416 co-relation queries the response was YES. [2024-11-24 01:37:41,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1151 events. 187/1151 cut-off events. For 405/416 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 6015 event pairs, 4 based on Foata normal form. 0/1083 useless extension candidates. Maximal degree in co-relation 1808. Up to 213 conditions per place. [2024-11-24 01:37:41,094 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2024-11-24 01:37:41,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2024-11-24 01:37:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2024-11-24 01:37:41,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2024-11-24 01:37:41,098 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2024-11-24 01:37:41,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2024-11-24 01:37:41,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:37:41,105 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2024-11-24 01:37:41,105 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=283, PETRI_TRANSITIONS=287} [2024-11-24 01:37:41,106 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-24 01:37:41,106 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2024-11-24 01:37:41,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 306.3333333333333) internal successors, (919), 3 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:41,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:41,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:41,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:37:41,108 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:41,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1460093157, now seen corresponding path program 1 times [2024-11-24 01:37:41,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:41,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137975459] [2024-11-24 01:37:41,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:41,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:41,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:43,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137975459] [2024-11-24 01:37:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137975459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:43,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:43,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-24 01:37:43,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907849904] [2024-11-24 01:37:43,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:43,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 01:37:43,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:43,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 01:37:43,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-24 01:37:46,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 344 [2024-11-24 01:37:46,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 287 transitions, 721 flow. Second operand has 22 states, 22 states have (on average 252.54545454545453) internal successors, (5556), 22 states have internal predecessors, (5556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:46,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:46,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 344 [2024-11-24 01:37:46,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:49,822 INFO L124 PetriNetUnfolderBase]: 672/2542 cut-off events. [2024-11-24 01:37:49,822 INFO L125 PetriNetUnfolderBase]: For 927/958 co-relation queries the response was YES. [2024-11-24 01:37:49,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4685 conditions, 2542 events. 672/2542 cut-off events. For 927/958 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 18491 event pairs, 168 based on Foata normal form. 26/2406 useless extension candidates. Maximal degree in co-relation 4642. Up to 363 conditions per place. [2024-11-24 01:37:49,841 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 77 selfloop transitions, 35 changer transitions 0/318 dead transitions. [2024-11-24 01:37:49,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 318 transitions, 1037 flow [2024-11-24 01:37:49,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-24 01:37:49,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-24 01:37:49,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8098 transitions. [2024-11-24 01:37:49,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7356468023255814 [2024-11-24 01:37:49,857 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 32 states and 8098 transitions. [2024-11-24 01:37:49,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 318 transitions, 1037 flow [2024-11-24 01:37:49,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 318 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-24 01:37:49,865 INFO L231 Difference]: Finished difference. Result has 313 places, 286 transitions, 787 flow [2024-11-24 01:37:49,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=32, PETRI_FLOW=787, PETRI_PLACES=313, PETRI_TRANSITIONS=286} [2024-11-24 01:37:49,868 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -2 predicate places. [2024-11-24 01:37:49,868 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 286 transitions, 787 flow [2024-11-24 01:37:49,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 252.54545454545453) internal successors, (5556), 22 states have internal predecessors, (5556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:49,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:49,870 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:49,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:37:49,870 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:49,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:49,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1037906910, now seen corresponding path program 1 times [2024-11-24 01:37:49,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:49,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008045932] [2024-11-24 01:37:49,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:49,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:50,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:50,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008045932] [2024-11-24 01:37:50,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008045932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:50,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:50,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:37:50,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928379486] [2024-11-24 01:37:50,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:50,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:37:50,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:50,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:37:50,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:37:50,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-24 01:37:50,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 286 transitions, 787 flow. Second operand has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:50,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:50,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-24 01:37:50,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:51,506 INFO L124 PetriNetUnfolderBase]: 373/1726 cut-off events. [2024-11-24 01:37:51,507 INFO L125 PetriNetUnfolderBase]: For 1455/1463 co-relation queries the response was YES. [2024-11-24 01:37:51,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 1726 events. 373/1726 cut-off events. For 1455/1463 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 10799 event pairs, 85 based on Foata normal form. 8/1640 useless extension candidates. Maximal degree in co-relation 3347. Up to 413 conditions per place. [2024-11-24 01:37:51,520 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 56 selfloop transitions, 15 changer transitions 0/315 dead transitions. [2024-11-24 01:37:51,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 315 transitions, 1047 flow [2024-11-24 01:37:51,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:37:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-24 01:37:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-24 01:37:51,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-24 01:37:51,524 INFO L175 Difference]: Start difference. First operand has 313 places, 286 transitions, 787 flow. Second operand 6 states and 1773 transitions. [2024-11-24 01:37:51,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 315 transitions, 1047 flow [2024-11-24 01:37:51,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 315 transitions, 975 flow, removed 0 selfloop flow, removed 31 redundant places. [2024-11-24 01:37:51,532 INFO L231 Difference]: Finished difference. Result has 292 places, 299 transitions, 869 flow [2024-11-24 01:37:51,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=869, PETRI_PLACES=292, PETRI_TRANSITIONS=299} [2024-11-24 01:37:51,533 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-24 01:37:51,533 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 299 transitions, 869 flow [2024-11-24 01:37:51,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 289.5) internal successors, (1737), 6 states have internal predecessors, (1737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:51,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:51,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:51,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:37:51,534 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:51,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:51,535 INFO L85 PathProgramCache]: Analyzing trace with hash -468623775, now seen corresponding path program 1 times [2024-11-24 01:37:51,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:51,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362248524] [2024-11-24 01:37:51,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:51,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:51,618 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:51,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:51,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362248524] [2024-11-24 01:37:51,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362248524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:37:51,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:37:51,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:37:51,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063837375] [2024-11-24 01:37:51,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:37:51,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:37:51,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:51,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:37:51,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:37:51,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-24 01:37:51,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 299 transitions, 869 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:51,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:51,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-24 01:37:51,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:37:52,069 INFO L124 PetriNetUnfolderBase]: 434/1617 cut-off events. [2024-11-24 01:37:52,070 INFO L125 PetriNetUnfolderBase]: For 3557/3613 co-relation queries the response was YES. [2024-11-24 01:37:52,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3794 conditions, 1617 events. 434/1617 cut-off events. For 3557/3613 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9342 event pairs, 92 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 3750. Up to 435 conditions per place. [2024-11-24 01:37:52,089 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-24 01:37:52,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 305 transitions, 987 flow [2024-11-24 01:37:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:37:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-24 01:37:52,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-24 01:37:52,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-24 01:37:52,092 INFO L175 Difference]: Start difference. First operand has 292 places, 299 transitions, 869 flow. Second operand 3 states and 925 transitions. [2024-11-24 01:37:52,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 305 transitions, 987 flow [2024-11-24 01:37:52,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 305 transitions, 957 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-11-24 01:37:52,102 INFO L231 Difference]: Finished difference. Result has 293 places, 298 transitions, 847 flow [2024-11-24 01:37:52,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=847, PETRI_PLACES=293, PETRI_TRANSITIONS=298} [2024-11-24 01:37:52,103 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-24 01:37:52,103 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 298 transitions, 847 flow [2024-11-24 01:37:52,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:52,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:37:52,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:37:52,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-24 01:37:52,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:37:52,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:37:52,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1935256271, now seen corresponding path program 1 times [2024-11-24 01:37:52,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:37:52,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268483797] [2024-11-24 01:37:52,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:52,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:37:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:53,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:37:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268483797] [2024-11-24 01:37:53,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268483797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:37:53,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390827051] [2024-11-24 01:37:53,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:37:53,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:37:53,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:37:53,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:37:53,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:37:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:37:53,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-24 01:37:53,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:37:54,042 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:37:54,180 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:37:54,180 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:37:54,682 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-24 01:37:54,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 77 [2024-11-24 01:37:54,703 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-24 01:37:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2024-11-24 01:37:54,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:54,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:37:55,005 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-24 01:37:55,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 118 [2024-11-24 01:37:55,147 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-24 01:37:55,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 142 [2024-11-24 01:37:55,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2024-11-24 01:37:55,266 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:37:55,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 1 [2024-11-24 01:37:55,344 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:37:55,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-24 01:37:55,416 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:37:55,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-24 01:37:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:37:55,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390827051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:37:55,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:37:55,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-24 01:37:55,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397066184] [2024-11-24 01:37:55,861 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:37:55,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-24 01:37:55,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:37:55,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-24 01:37:55,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-24 01:37:58,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2024-11-24 01:37:58,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 298 transitions, 847 flow. Second operand has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:37:58,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:37:58,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2024-11-24 01:37:58,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:38:01,531 INFO L124 PetriNetUnfolderBase]: 1346/5268 cut-off events. [2024-11-24 01:38:01,531 INFO L125 PetriNetUnfolderBase]: For 5589/5971 co-relation queries the response was YES. [2024-11-24 01:38:01,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10972 conditions, 5268 events. 1346/5268 cut-off events. For 5589/5971 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 45140 event pairs, 239 based on Foata normal form. 136/5115 useless extension candidates. Maximal degree in co-relation 10924. Up to 672 conditions per place. [2024-11-24 01:38:01,633 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 111 selfloop transitions, 58 changer transitions 0/388 dead transitions. [2024-11-24 01:38:01,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 388 transitions, 1728 flow [2024-11-24 01:38:01,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-24 01:38:01,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-24 01:38:01,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6556 transitions. [2024-11-24 01:38:01,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623255813953488 [2024-11-24 01:38:01,645 INFO L175 Difference]: Start difference. First operand has 293 places, 298 transitions, 847 flow. Second operand 25 states and 6556 transitions. [2024-11-24 01:38:01,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 388 transitions, 1728 flow [2024-11-24 01:38:01,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 388 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-24 01:38:01,660 INFO L231 Difference]: Finished difference. Result has 320 places, 330 transitions, 1268 flow [2024-11-24 01:38:01,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=843, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1268, PETRI_PLACES=320, PETRI_TRANSITIONS=330} [2024-11-24 01:38:01,661 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2024-11-24 01:38:01,662 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 330 transitions, 1268 flow [2024-11-24 01:38:01,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 261.0) internal successors, (5742), 22 states have internal predecessors, (5742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:01,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:38:01,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:38:01,677 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:38:01,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-24 01:38:01,865 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:38:01,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:38:01,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1390206865, now seen corresponding path program 2 times [2024-11-24 01:38:01,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:38:01,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006591096] [2024-11-24 01:38:01,871 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:38:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:38:01,982 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:38:01,982 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:38:03,782 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:38:03,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:38:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006591096] [2024-11-24 01:38:03,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006591096] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:38:03,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947521636] [2024-11-24 01:38:03,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:38:03,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:03,783 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:38:03,785 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:38:03,794 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:38:04,187 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:38:04,188 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:38:04,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-24 01:38:04,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:38:04,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:38:04,450 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-24 01:38:04,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-24 01:38:05,010 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-24 01:38:05,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 77 [2024-11-24 01:38:05,030 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-24 01:38:05,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 67 [2024-11-24 01:38:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:38:05,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:38:05,292 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-24 01:38:05,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 118 [2024-11-24 01:38:05,422 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-24 01:38:05,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 134 treesize of output 142 [2024-11-24 01:38:05,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-24 01:38:05,497 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:38:05,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-24 01:38:05,556 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:38:05,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 123 treesize of output 1 [2024-11-24 01:38:05,601 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-24 01:38:05,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 122 treesize of output 1 [2024-11-24 01:38:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-24 01:38:05,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947521636] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:38:05,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:38:05,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 37 [2024-11-24 01:38:05,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413959775] [2024-11-24 01:38:05,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:38:05,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-24 01:38:05,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:38:05,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-24 01:38:05,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2024-11-24 01:38:11,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 344 [2024-11-24 01:38:11,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 330 transitions, 1268 flow. Second operand has 38 states, 38 states have (on average 208.94736842105263) internal successors, (7940), 38 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:11,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:38:11,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 344 [2024-11-24 01:38:11,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:38:16,472 INFO L124 PetriNetUnfolderBase]: 2371/8176 cut-off events. [2024-11-24 01:38:16,473 INFO L125 PetriNetUnfolderBase]: For 15522/17068 co-relation queries the response was YES. [2024-11-24 01:38:16,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19966 conditions, 8176 events. 2371/8176 cut-off events. For 15522/17068 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 78295 event pairs, 635 based on Foata normal form. 456/8400 useless extension candidates. Maximal degree in co-relation 19911. Up to 1808 conditions per place. [2024-11-24 01:38:16,542 INFO L140 encePairwiseOnDemand]: 291/344 looper letters, 144 selfloop transitions, 105 changer transitions 0/426 dead transitions. [2024-11-24 01:38:16,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 426 transitions, 2453 flow [2024-11-24 01:38:16,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-24 01:38:16,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-11-24 01:38:16,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7708 transitions. [2024-11-24 01:38:16,550 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6055939660590823 [2024-11-24 01:38:16,550 INFO L175 Difference]: Start difference. First operand has 320 places, 330 transitions, 1268 flow. Second operand 37 states and 7708 transitions. [2024-11-24 01:38:16,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 426 transitions, 2453 flow [2024-11-24 01:38:16,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 426 transitions, 2408 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-11-24 01:38:16,579 INFO L231 Difference]: Finished difference. Result has 343 places, 369 transitions, 1882 flow [2024-11-24 01:38:16,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1223, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=73, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=37, PETRI_FLOW=1882, PETRI_PLACES=343, PETRI_TRANSITIONS=369} [2024-11-24 01:38:16,580 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 28 predicate places. [2024-11-24 01:38:16,580 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 369 transitions, 1882 flow [2024-11-24 01:38:16,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 208.94736842105263) internal successors, (7940), 38 states have internal predecessors, (7940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:16,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:38:16,584 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:38:16,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-24 01:38:16,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:16,785 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:38:16,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:38:16,787 INFO L85 PathProgramCache]: Analyzing trace with hash -220630722, now seen corresponding path program 1 times [2024-11-24 01:38:16,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:38:16,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265926335] [2024-11-24 01:38:16,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:38:16,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:38:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:38:17,318 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:17,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:38:17,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265926335] [2024-11-24 01:38:17,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265926335] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:38:17,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739482291] [2024-11-24 01:38:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:38:17,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:17,320 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:38:17,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:38:17,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:38:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:38:17,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-24 01:38:17,558 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:38:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:17,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:38:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:18,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739482291] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:38:18,405 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:38:18,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-24 01:38:18,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274669764] [2024-11-24 01:38:18,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:38:18,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 01:38:18,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:38:18,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 01:38:18,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:38:19,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-24 01:38:19,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 369 transitions, 1882 flow. Second operand has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:19,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:38:19,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-24 01:38:19,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:38:23,951 INFO L124 PetriNetUnfolderBase]: 4136/14365 cut-off events. [2024-11-24 01:38:23,951 INFO L125 PetriNetUnfolderBase]: For 28360/32459 co-relation queries the response was YES. [2024-11-24 01:38:24,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33593 conditions, 14365 events. 4136/14365 cut-off events. For 28360/32459 co-relation queries the response was YES. Maximal size of possible extension queue 341. Compared 148381 event pairs, 1390 based on Foata normal form. 250/13452 useless extension candidates. Maximal degree in co-relation 33536. Up to 3586 conditions per place. [2024-11-24 01:38:24,069 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 164 selfloop transitions, 97 changer transitions 2/522 dead transitions. [2024-11-24 01:38:24,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 522 transitions, 3281 flow [2024-11-24 01:38:24,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-24 01:38:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-24 01:38:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6236 transitions. [2024-11-24 01:38:24,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881698685540951 [2024-11-24 01:38:24,075 INFO L175 Difference]: Start difference. First operand has 343 places, 369 transitions, 1882 flow. Second operand 23 states and 6236 transitions. [2024-11-24 01:38:24,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 522 transitions, 3281 flow [2024-11-24 01:38:24,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 522 transitions, 3092 flow, removed 41 selfloop flow, removed 29 redundant places. [2024-11-24 01:38:24,158 INFO L231 Difference]: Finished difference. Result has 349 places, 433 transitions, 2397 flow [2024-11-24 01:38:24,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1751, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2397, PETRI_PLACES=349, PETRI_TRANSITIONS=433} [2024-11-24 01:38:24,160 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 34 predicate places. [2024-11-24 01:38:24,160 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 433 transitions, 2397 flow [2024-11-24 01:38:24,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.125) internal successors, (6411), 24 states have internal predecessors, (6411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:24,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:38:24,162 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:38:24,173 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:38:24,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:24,366 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:38:24,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:38:24,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1695107886, now seen corresponding path program 1 times [2024-11-24 01:38:24,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:38:24,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583387233] [2024-11-24 01:38:24,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:38:24,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:38:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:38:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:38:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583387233] [2024-11-24 01:38:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583387233] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:38:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456353242] [2024-11-24 01:38:24,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:38:24,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:24,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:38:24,776 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:38:24,780 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:38:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:38:24,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-24 01:38:24,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:38:25,473 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:25,473 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:38:25,942 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 34 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-24 01:38:25,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456353242] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:38:25,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:38:25,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-24 01:38:25,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898589794] [2024-11-24 01:38:25,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:38:25,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-24 01:38:25,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:38:25,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-24 01:38:25,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-24 01:38:27,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-24 01:38:27,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 433 transitions, 2397 flow. Second operand has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:27,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:38:27,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-24 01:38:27,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:38:31,739 INFO L124 PetriNetUnfolderBase]: 2275/10372 cut-off events. [2024-11-24 01:38:31,739 INFO L125 PetriNetUnfolderBase]: For 25808/26076 co-relation queries the response was YES. [2024-11-24 01:38:31,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28463 conditions, 10372 events. 2275/10372 cut-off events. For 25808/26076 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 99687 event pairs, 672 based on Foata normal form. 87/10102 useless extension candidates. Maximal degree in co-relation 28390. Up to 1691 conditions per place. [2024-11-24 01:38:31,852 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 96 selfloop transitions, 44 changer transitions 151/544 dead transitions. [2024-11-24 01:38:31,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 544 transitions, 3808 flow [2024-11-24 01:38:31,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-24 01:38:31,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-24 01:38:31,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6240 transitions. [2024-11-24 01:38:31,858 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788675429726997 [2024-11-24 01:38:31,858 INFO L175 Difference]: Start difference. First operand has 349 places, 433 transitions, 2397 flow. Second operand 23 states and 6240 transitions. [2024-11-24 01:38:31,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 544 transitions, 3808 flow [2024-11-24 01:38:31,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 544 transitions, 3768 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-24 01:38:31,996 INFO L231 Difference]: Finished difference. Result has 374 places, 380 transitions, 2080 flow [2024-11-24 01:38:31,997 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=2326, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=386, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=2080, PETRI_PLACES=374, PETRI_TRANSITIONS=380} [2024-11-24 01:38:31,997 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 59 predicate places. [2024-11-24 01:38:31,997 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 380 transitions, 2080 flow [2024-11-24 01:38:31,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 267.0) internal successors, (6408), 24 states have internal predecessors, (6408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:38:31,999 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:38:32,000 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:38:32,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-24 01:38:32,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-24 01:38:32,200 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:38:32,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:38:32,202 INFO L85 PathProgramCache]: Analyzing trace with hash 247141950, now seen corresponding path program 2 times [2024-11-24 01:38:32,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:38:32,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242766415] [2024-11-24 01:38:32,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:38:32,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:38:32,286 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:38:32,286 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:38:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:38:36,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:38:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242766415] [2024-11-24 01:38:36,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242766415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:38:36,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44971503] [2024-11-24 01:38:36,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-24 01:38:36,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:38:36,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:38:36,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:38:36,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-24 01:38:37,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-24 01:38:37,608 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:38:37,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-24 01:38:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:38:37,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:38:37,953 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:38:37,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:38:38,697 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-24 01:38:38,698 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-24 01:38:39,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-24 01:38:39,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-24 01:38:40,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:38:40,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2024-11-24 01:38:40,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:38:40,165 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2024-11-24 01:38:40,455 INFO L349 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2024-11-24 01:38:40,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 151 treesize of output 149 [2024-11-24 01:38:40,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 115 [2024-11-24 01:38:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:38:40,819 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:38:44,884 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse1 (+ .cse6 c_~B~0.offset)) (.cse2 (+ .cse6 c_~B~0.offset 1)) (.cse3 (+ .cse6 2 c_~B~0.offset)) (.cse4 (+ .cse6 3 c_~B~0.offset)) (.cse5 (select |c_#race| c_~A~0.base)) (.cse7 (* c_thread1Thread1of1ForFork0_~i~0 4))) (and (forall ((~A~0.offset Int) (v_ArrVal_1239 (Array Int Int))) (= (select (select (store (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ .cse6 ~A~0.offset) 0) (+ .cse6 ~A~0.offset 1) 0) (+ .cse6 2 ~A~0.offset) 0) (+ .cse6 3 ~A~0.offset) 0)))) (store .cse0 c_~B~0.base (store (store (store (store (select .cse0 c_~B~0.base) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) c_~C~0.base v_ArrVal_1239) c_~B~0.base) (+ .cse7 c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_1239 (Array Int Int))) (= (select (select (store (let ((.cse8 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ .cse6 ~A~0.offset) 0) (+ .cse6 ~A~0.offset 1) 0) (+ .cse6 2 ~A~0.offset) 0) (+ .cse6 3 ~A~0.offset) 0)))) (store .cse8 c_~B~0.base (store (store (store (store (select .cse8 c_~B~0.base) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) c_~C~0.base v_ArrVal_1239) c_~B~0.base) (+ 2 .cse7 c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_1239 (Array Int Int))) (= (select (select (store (let ((.cse9 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ .cse6 ~A~0.offset) 0) (+ .cse6 ~A~0.offset 1) 0) (+ .cse6 2 ~A~0.offset) 0) (+ .cse6 3 ~A~0.offset) 0)))) (store .cse9 c_~B~0.base (store (store (store (store (select .cse9 c_~B~0.base) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) c_~C~0.base v_ArrVal_1239) c_~B~0.base) (+ 3 .cse7 c_~B~0.offset)) 0)) (forall ((~A~0.offset Int) (v_ArrVal_1239 (Array Int Int))) (= (select (select (store (let ((.cse10 (store |c_#race| c_~A~0.base (store (store (store (store .cse5 (+ .cse6 ~A~0.offset) 0) (+ .cse6 ~A~0.offset 1) 0) (+ .cse6 2 ~A~0.offset) 0) (+ .cse6 3 ~A~0.offset) 0)))) (store .cse10 c_~B~0.base (store (store (store (store (select .cse10 c_~B~0.base) .cse1 0) .cse2 0) .cse3 0) .cse4 0))) c_~C~0.base v_ArrVal_1239) c_~B~0.base) (+ .cse7 c_~B~0.offset 1)) 0))))) is different from false [2024-11-24 01:39:17,012 INFO L349 Elim1Store]: treesize reduction 1170, result has 8.1 percent of original size [2024-11-24 01:39:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 171 treesize of output 165 [2024-11-24 01:39:17,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-24 01:39:17,036 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:39:17,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 141 [2024-11-24 01:39:17,079 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:39:17,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 17 [2024-11-24 01:39:17,237 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:39:17,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 323 [2024-11-24 01:39:17,398 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:39:17,483 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:39:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 1 [2024-11-24 01:39:17,485 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:39:17,574 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:39:17,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 1 [2024-11-24 01:39:17,576 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:39:17,643 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:39:17,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 1 [2024-11-24 01:39:31,769 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:39:31,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44971503] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:39:31,769 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:39:31,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 16] total 70 [2024-11-24 01:39:31,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618974937] [2024-11-24 01:39:31,770 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:39:31,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-24 01:39:31,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:39:31,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-24 01:39:31,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4515, Unknown=42, NotChecked=136, Total=4970 [2024-11-24 01:39:32,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 344 [2024-11-24 01:39:32,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 380 transitions, 2080 flow. Second operand has 71 states, 71 states have (on average 160.08450704225353) internal successors, (11366), 71 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:39:32,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:39:32,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 344 [2024-11-24 01:39:32,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:41:46,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:41:49,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:42:13,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:42:17,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:42:41,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:43:02,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:43:05,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:43:35,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:45:40,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:45:46,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:45:53,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:45:57,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:20,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:23,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:28,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:32,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:46:39,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:47:12,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.91s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:47:15,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:48:12,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:48:14,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:48:19,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:48:48,428 INFO L124 PetriNetUnfolderBase]: 28061/51893 cut-off events. [2024-11-24 01:48:48,429 INFO L125 PetriNetUnfolderBase]: For 102218/102387 co-relation queries the response was YES. [2024-11-24 01:48:49,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157801 conditions, 51893 events. 28061/51893 cut-off events. For 102218/102387 co-relation queries the response was YES. Maximal size of possible extension queue 1541. Compared 490425 event pairs, 1455 based on Foata normal form. 280/47924 useless extension candidates. Maximal degree in co-relation 157712. Up to 9013 conditions per place. [2024-11-24 01:48:49,252 INFO L140 encePairwiseOnDemand]: 275/344 looper letters, 678 selfloop transitions, 455 changer transitions 28/1296 dead transitions. [2024-11-24 01:48:49,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1296 transitions, 10299 flow [2024-11-24 01:48:49,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-24 01:48:49,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2024-11-24 01:48:49,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 15665 transitions. [2024-11-24 01:48:49,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47435198643410853 [2024-11-24 01:48:49,283 INFO L175 Difference]: Start difference. First operand has 374 places, 380 transitions, 2080 flow. Second operand 96 states and 15665 transitions. [2024-11-24 01:48:49,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 1296 transitions, 10299 flow [2024-11-24 01:48:50,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1296 transitions, 9665 flow, removed 176 selfloop flow, removed 28 redundant places. [2024-11-24 01:48:50,855 INFO L231 Difference]: Finished difference. Result has 452 places, 783 transitions, 6929 flow [2024-11-24 01:48:50,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=1868, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=96, PETRI_FLOW=6929, PETRI_PLACES=452, PETRI_TRANSITIONS=783} [2024-11-24 01:48:50,856 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 137 predicate places. [2024-11-24 01:48:50,856 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 783 transitions, 6929 flow [2024-11-24 01:48:50,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 160.08450704225353) internal successors, (11366), 71 states have internal predecessors, (11366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:48:50,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-24 01:48:50,860 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:48:50,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-24 01:48:51,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-24 01:48:51,061 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 58 more)] === [2024-11-24 01:48:51,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:48:51,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1100709826, now seen corresponding path program 3 times [2024-11-24 01:48:51,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:48:51,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294439931] [2024-11-24 01:48:51,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:48:51,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:48:51,394 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-24 01:48:51,394 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:49:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:49:08,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:49:08,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294439931] [2024-11-24 01:49:08,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294439931] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:49:08,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [480758457] [2024-11-24 01:49:08,161 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-24 01:49:08,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:49:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:49:08,163 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:49:08,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6b4082f0-cb2f-47f4-baa4-344c8326b33b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-24 01:49:10,608 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-24 01:49:10,608 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-24 01:49:10,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-24 01:49:10,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:49:10,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-24 01:49:11,399 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-24 01:49:11,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-24 01:49:12,914 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-24 01:49:12,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-24 01:49:15,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-24 01:49:16,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2024-11-24 01:49:16,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2024-11-24 01:49:16,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 52 [2024-11-24 01:49:17,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:49:17,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:49:17,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:49:17,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-24 01:49:17,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 31 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 147 [2024-11-24 01:49:17,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 113 [2024-11-24 01:49:17,645 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:49:17,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:49:22,847 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse2 (+ 3 .cse1 c_~B~0.offset))) (let ((.cse0 (let ((.cse4 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse2 0))) (.cse5 (* c_thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse3 (store (store (store (store (select .cse4 c_~A~0.base) (+ c_~A~0.offset .cse5) 0) (+ c_~A~0.offset .cse5 1) 0) (+ c_~A~0.offset .cse5 2) 0) (+ c_~A~0.offset .cse5 3) 0))) (store (store |c_#race| c_~A~0.base .cse3) c_~B~0.base (store (store (store (store (select (store .cse4 c_~A~0.base .cse3) c_~B~0.base) (+ .cse5 c_~B~0.offset) 0) (+ .cse5 c_~B~0.offset 1) 0) (+ .cse5 2 c_~B~0.offset) 0) (+ .cse5 3 c_~B~0.offset) 0)))))) (and (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse1 c_~B~0.offset)) 0)) (forall ((v_ArrVal_1491 (Array Int Int))) (= 0 (select (select (store .cse0 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse2))) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse1 c_~B~0.offset 1)) 0)) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse0 c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ 2 .cse1 c_~B~0.offset)) 0)))))) is different from false [2024-11-24 01:49:55,198 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse8 (+ 3 .cse5 c_~B~0.offset))) (let ((.cse2 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse8 0)))) (let ((.cse0 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse4 (select .cse2 c_~A~0.base))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse3 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse1 (store (store (store (store .cse4 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) (store (store |c_#race| c_~A~0.base .cse1) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse1) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse5 c_~B~0.offset 1)) 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (= (select (select (store (let ((.cse7 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse6 (store (store (store (store .cse4 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) (store (store |c_#race| c_~A~0.base .cse6) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse6) c_~B~0.base) (+ .cse7 c_~B~0.offset) 0) (+ .cse7 c_~B~0.offset 1) 0) (+ 2 .cse7 c_~B~0.offset) 0) (+ 3 .cse7 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse8) 0) (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse10 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse9 (store (store (store (store .cse4 (+ c_~A~0.offset .cse10) 0) (+ c_~A~0.offset .cse10 1) 0) (+ c_~A~0.offset 2 .cse10) 0) (+ c_~A~0.offset 3 .cse10) 0))) (store (store |c_#race| c_~A~0.base .cse9) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse9) c_~B~0.base) (+ .cse10 c_~B~0.offset) 0) (+ .cse10 c_~B~0.offset 1) 0) (+ 2 .cse10 c_~B~0.offset) 0) (+ 3 .cse10 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse5 c_~B~0.offset)) 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse12 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse11 (store (store (store (store .cse4 (+ c_~A~0.offset .cse12) 0) (+ c_~A~0.offset .cse12 1) 0) (+ c_~A~0.offset 2 .cse12) 0) (+ c_~A~0.offset 3 .cse12) 0))) (store (store |c_#race| c_~A~0.base .cse11) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse11) c_~B~0.base) (+ .cse12 c_~B~0.offset) 0) (+ .cse12 c_~B~0.offset 1) 0) (+ 2 .cse12 c_~B~0.offset) 0) (+ 3 .cse12 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ 2 .cse5 c_~B~0.offset)) 0)))))))) is different from false [2024-11-24 01:49:59,522 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse13 (+ 2 .cse5 c_~B~0.offset)) (.cse10 (+ 3 .cse5 c_~B~0.offset))) (let ((.cse2 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse13 0) .cse10 0)))) (let ((.cse0 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse4 (select .cse2 c_~A~0.base))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse3 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse1 (store (store (store (store .cse4 (+ c_~A~0.offset .cse3) 0) (+ c_~A~0.offset .cse3 1) 0) (+ c_~A~0.offset 2 .cse3) 0) (+ c_~A~0.offset 3 .cse3) 0))) (store (store |c_#race| c_~A~0.base .cse1) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse1) c_~B~0.base) (+ .cse3 c_~B~0.offset) 0) (+ .cse3 c_~B~0.offset 1) 0) (+ 2 .cse3 c_~B~0.offset) 0) (+ 3 .cse3 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse5 c_~B~0.offset 1)) 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse7 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse6 (store (store (store (store .cse4 (+ c_~A~0.offset .cse7) 0) (+ c_~A~0.offset .cse7 1) 0) (+ c_~A~0.offset 2 .cse7) 0) (+ c_~A~0.offset 3 .cse7) 0))) (store (store |c_#race| c_~A~0.base .cse6) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse6) c_~B~0.base) (+ .cse7 c_~B~0.offset) 0) (+ .cse7 c_~B~0.offset 1) 0) (+ 2 .cse7 c_~B~0.offset) 0) (+ 3 .cse7 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ .cse5 c_~B~0.offset)) 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse8 (store (store (store (store .cse4 (+ c_~A~0.offset .cse9) 0) (+ c_~A~0.offset .cse9 1) 0) (+ c_~A~0.offset 2 .cse9) 0) (+ c_~A~0.offset 3 .cse9) 0))) (store (store |c_#race| c_~A~0.base .cse8) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse8) c_~B~0.base) (+ .cse9 c_~B~0.offset) 0) (+ .cse9 c_~B~0.offset 1) 0) (+ 2 .cse9 c_~B~0.offset) 0) (+ 3 .cse9 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse10) 0))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse12 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse11 (store (store (store (store .cse4 (+ c_~A~0.offset .cse12) 0) (+ c_~A~0.offset .cse12 1) 0) (+ c_~A~0.offset 2 .cse12) 0) (+ c_~A~0.offset 3 .cse12) 0))) (store (store |c_#race| c_~A~0.base .cse11) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse11) c_~B~0.base) (+ .cse12 c_~B~0.offset) 0) (+ .cse12 c_~B~0.offset 1) 0) (+ 2 .cse12 c_~B~0.offset) 0) (+ 3 .cse12 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse13) 0)))))))) is different from false [2024-11-24 01:50:37,840 INFO L349 Elim1Store]: treesize reduction 1170, result has 8.1 percent of original size [2024-11-24 01:50:37,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 171 treesize of output 165 [2024-11-24 01:50:37,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2024-11-24 01:50:37,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:50:37,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 141 [2024-11-24 01:50:37,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 17 [2024-11-24 01:50:38,060 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:50:38,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 116 treesize of output 323 [2024-11-24 01:50:38,320 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:50:38,417 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:50:38,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 1 [2024-11-24 01:50:38,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:50:38,499 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:50:38,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 150 treesize of output 1 [2024-11-24 01:50:38,502 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-24 01:50:38,599 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-24 01:50:38,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 151 treesize of output 1 [2024-11-24 01:50:55,043 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-24 01:50:55,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [480758457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-24 01:50:55,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-24 01:50:55,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 18] total 66 [2024-11-24 01:50:55,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620134837] [2024-11-24 01:50:55,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-24 01:50:55,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-24 01:50:55,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:50:55,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-24 01:50:55,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3740, Unknown=44, NotChecked=378, Total=4422 [2024-11-24 01:50:56,833 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 344 [2024-11-24 01:50:56,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 783 transitions, 6929 flow. Second operand has 67 states, 67 states have (on average 160.0597014925373) internal successors, (10724), 67 states have internal predecessors, (10724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-24 01:50:56,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-24 01:50:56,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 344 [2024-11-24 01:50:56,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-24 01:51:34,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-24 01:51:39,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]