./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 d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/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_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB --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-d790fec [2024-11-28 03:58:13,948 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:58:14,036 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-28 03:58:14,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:58:14,042 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:58:14,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:58:14,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:58:14,068 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:58:14,069 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:58:14,069 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:58:14,069 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:58:14,070 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:58:14,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-28 03:58:14,071 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:58:14,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:58:14,072 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:58:14,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:58:14,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:58:14,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:58:14,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:58:14,074 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_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB 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-28 03:58:14,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:58:14,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:58:14,403 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:58:14,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:58:14,404 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:58:14,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-28 03:58:17,553 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/data/d9314732d/283723f74afe49c6912e3c598e9c640c/FLAGc4ab4d183 [2024-11-28 03:58:17,855 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:58:17,856 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/sv-benchmarks/c/weaver/popl20-three-array-sum.wvr.c [2024-11-28 03:58:17,865 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/data/d9314732d/283723f74afe49c6912e3c598e9c640c/FLAGc4ab4d183 [2024-11-28 03:58:18,146 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/data/d9314732d/283723f74afe49c6912e3c598e9c640c [2024-11-28 03:58:18,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:58:18,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:58:18,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:58:18,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:58:18,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:58:18,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca7ef00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18, skipping insertion in model container [2024-11-28 03:58:18,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,187 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:58:18,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:58:18,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:58:18,477 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:58:18,494 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:58:18,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18 WrapperNode [2024-11-28 03:58:18,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:58:18,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:58:18,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:58:18,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:58:18,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,553 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 9, calls inlined = 13, statements flattened = 186 [2024-11-28 03:58:18,553 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:58:18,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:58:18,554 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:58:18,554 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:58:18,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,573 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,606 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,608 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,621 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,622 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:58:18,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:58:18,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:58:18,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:58:18,636 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (1/1) ... [2024-11-28 03:58:18,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:58:18,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:58:18,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:58:18,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:58:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:58:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-28 03:58:18,718 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-28 03:58:18,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-28 03:58:18,719 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:58:18,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:58:18,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:58:18,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 03:58:18,721 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:58:18,864 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:58:18,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:58:19,726 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:58:19,726 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:58:19,940 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:58:19,943 INFO L312 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-28 03:58:19,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:58:19 BoogieIcfgContainer [2024-11-28 03:58:19,944 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:58:19,947 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:58:19,948 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:58:19,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:58:19,953 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:58:18" (1/3) ... [2024-11-28 03:58:19,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e2de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:58:19, skipping insertion in model container [2024-11-28 03:58:19,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:58:18" (2/3) ... [2024-11-28 03:58:19,956 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46e2de4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:58:19, skipping insertion in model container [2024-11-28 03:58:19,956 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:58:19" (3/3) ... [2024-11-28 03:58:19,957 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-three-array-sum.wvr.c [2024-11-28 03:58:19,976 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:58:19,978 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-28 03:58:19,978 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:58:20,136 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-28 03:58:20,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 709 flow [2024-11-28 03:58:20,428 INFO L124 PetriNetUnfolderBase]: 20/341 cut-off events. [2024-11-28 03:58:20,434 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-28 03:58:20,445 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-28 03:58:20,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 709 flow [2024-11-28 03:58:20,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 315 places, 324 transitions, 666 flow [2024-11-28 03:58:20,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:58:20,498 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;@74385e4e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:58:20,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-28 03:58:20,506 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:58:20,506 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-28 03:58:20,506 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:58:20,507 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:20,509 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-28 03:58:20,510 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-28 03:58:20,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:20,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1514911445, now seen corresponding path program 1 times [2024-11-28 03:58:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126584845] [2024-11-28 03:58:20,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:20,762 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-28 03:58:20,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:20,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126584845] [2024-11-28 03:58:20,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126584845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:20,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031926744] [2024-11-28 03:58:20,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:20,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:20,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:20,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:20,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:20,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 296 out of 344 [2024-11-28 03:58:20,894 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-28 03:58:20,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:20,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 296 of 344 [2024-11-28 03:58:20,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:21,268 INFO L124 PetriNetUnfolderBase]: 85/884 cut-off events. [2024-11-28 03:58:21,269 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:58:21,275 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-28 03:58:21,281 INFO L140 encePairwiseOnDemand]: 317/344 looper letters, 18 selfloop transitions, 2 changer transitions 6/299 dead transitions. [2024-11-28 03:58:21,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 299 transitions, 656 flow [2024-11-28 03:58:21,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 933 transitions. [2024-11-28 03:58:21,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9040697674418605 [2024-11-28 03:58:21,304 INFO L175 Difference]: Start difference. First operand has 315 places, 324 transitions, 666 flow. Second operand 3 states and 933 transitions. [2024-11-28 03:58:21,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 299 transitions, 656 flow [2024-11-28 03:58:21,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 299 transitions, 644 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:58:21,320 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 596 flow [2024-11-28 03:58:21,323 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-28 03:58:21,327 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -17 predicate places. [2024-11-28 03:58:21,328 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 596 flow [2024-11-28 03:58:21,329 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-28 03:58:21,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:21,329 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-28 03:58:21,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:58:21,329 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-28 03:58:21,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:21,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1274509642, now seen corresponding path program 1 times [2024-11-28 03:58:21,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:21,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888172689] [2024-11-28 03:58:21,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:21,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:21,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:21,408 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-28 03:58:21,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:21,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888172689] [2024-11-28 03:58:21,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888172689] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:21,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:21,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:21,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225650309] [2024-11-28 03:58:21,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:21,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:21,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:21,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:21,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:21,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 290 out of 344 [2024-11-28 03:58:21,468 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-28 03:58:21,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:21,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 290 of 344 [2024-11-28 03:58:21,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:21,838 INFO L124 PetriNetUnfolderBase]: 213/995 cut-off events. [2024-11-28 03:58:21,838 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-11-28 03:58:21,843 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-28 03:58:21,850 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 21 selfloop transitions, 1 changer transitions 0/287 dead transitions. [2024-11-28 03:58:21,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 287 transitions, 628 flow [2024-11-28 03:58:21,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:21,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-11-28 03:58:21,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701550387596899 [2024-11-28 03:58:21,854 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 596 flow. Second operand 3 states and 898 transitions. [2024-11-28 03:58:21,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 287 transitions, 628 flow [2024-11-28 03:58:21,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 287 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:21,865 INFO L231 Difference]: Finished difference. Result has 286 places, 287 transitions, 582 flow [2024-11-28 03:58:21,866 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-28 03:58:21,867 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -29 predicate places. [2024-11-28 03:58:21,867 INFO L471 AbstractCegarLoop]: Abstraction has has 286 places, 287 transitions, 582 flow [2024-11-28 03:58:21,868 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-28 03:58:21,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:21,868 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-28 03:58:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 03:58:21,869 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-28 03:58:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1344509392, now seen corresponding path program 1 times [2024-11-28 03:58:21,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:21,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323058285] [2024-11-28 03:58:21,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:21,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:23,021 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-28 03:58:23,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:23,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323058285] [2024-11-28 03:58:23,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323058285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:23,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:23,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:58:23,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649218074] [2024-11-28 03:58:23,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:23,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:58:23,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:23,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:58:23,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:58:23,466 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 344 [2024-11-28 03:58:23,468 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-28 03:58:23,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:23,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 344 [2024-11-28 03:58:23,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:23,906 INFO L124 PetriNetUnfolderBase]: 128/873 cut-off events. [2024-11-28 03:58:23,906 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-28 03:58:23,912 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-28 03:58:23,916 INFO L140 encePairwiseOnDemand]: 326/344 looper letters, 41 selfloop transitions, 15 changer transitions 0/284 dead transitions. [2024-11-28 03:58:23,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 284 transitions, 688 flow [2024-11-28 03:58:23,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:58:23,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:58:23,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1613 transitions. [2024-11-28 03:58:23,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7814922480620154 [2024-11-28 03:58:23,925 INFO L175 Difference]: Start difference. First operand has 286 places, 287 transitions, 582 flow. Second operand 6 states and 1613 transitions. [2024-11-28 03:58:23,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 284 transitions, 688 flow [2024-11-28 03:58:23,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 284 transitions, 687 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:58:23,932 INFO L231 Difference]: Finished difference. Result has 287 places, 284 transitions, 605 flow [2024-11-28 03:58:23,932 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-28 03:58:23,933 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -28 predicate places. [2024-11-28 03:58:23,934 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 284 transitions, 605 flow [2024-11-28 03:58:23,935 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-28 03:58:23,935 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:23,935 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-28 03:58:23,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:58:23,936 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-28 03:58:23,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:23,937 INFO L85 PathProgramCache]: Analyzing trace with hash -482287339, now seen corresponding path program 1 times [2024-11-28 03:58:23,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:23,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170713277] [2024-11-28 03:58:23,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:23,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:23,987 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-28 03:58:23,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:23,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170713277] [2024-11-28 03:58:23,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170713277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:23,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:23,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:23,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574028263] [2024-11-28 03:58:23,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:23,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:23,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:23,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:23,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:24,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-28 03:58:24,018 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-28 03:58:24,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:24,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-28 03:58:24,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:24,133 INFO L124 PetriNetUnfolderBase]: 37/389 cut-off events. [2024-11-28 03:58:24,133 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 03:58:24,135 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-28 03:58:24,137 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/283 dead transitions. [2024-11-28 03:58:24,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 283 transitions, 633 flow [2024-11-28 03:58:24,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:24,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-28 03:58:24,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-28 03:58:24,141 INFO L175 Difference]: Start difference. First operand has 287 places, 284 transitions, 605 flow. Second operand 3 states and 919 transitions. [2024-11-28 03:58:24,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 283 transitions, 633 flow [2024-11-28 03:58:24,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 283 transitions, 603 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:58:24,147 INFO L231 Difference]: Finished difference. Result has 283 places, 283 transitions, 577 flow [2024-11-28 03:58:24,148 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-28 03:58:24,149 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-28 03:58:24,149 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 283 transitions, 577 flow [2024-11-28 03:58:24,150 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-28 03:58:24,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:24,150 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-28 03:58:24,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 03:58:24,151 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-28 03:58:24,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:24,152 INFO L85 PathProgramCache]: Analyzing trace with hash -187453708, now seen corresponding path program 1 times [2024-11-28 03:58:24,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:24,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536651651] [2024-11-28 03:58:24,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:24,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:24,213 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-28 03:58:24,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:24,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536651651] [2024-11-28 03:58:24,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536651651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:24,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:24,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:24,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733637738] [2024-11-28 03:58:24,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:24,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:24,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:24,215 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:24,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 301 out of 344 [2024-11-28 03:58:24,232 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-28 03:58:24,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:24,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 301 of 344 [2024-11-28 03:58:24,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:24,420 INFO L124 PetriNetUnfolderBase]: 37/388 cut-off events. [2024-11-28 03:58:24,420 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 03:58:24,422 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-28 03:58:24,423 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 13 selfloop transitions, 2 changer transitions 0/282 dead transitions. [2024-11-28 03:58:24,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 282 transitions, 605 flow [2024-11-28 03:58:24,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:24,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 919 transitions. [2024-11-28 03:58:24,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8905038759689923 [2024-11-28 03:58:24,428 INFO L175 Difference]: Start difference. First operand has 283 places, 283 transitions, 577 flow. Second operand 3 states and 919 transitions. [2024-11-28 03:58:24,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 282 transitions, 605 flow [2024-11-28 03:58:24,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 282 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:24,434 INFO L231 Difference]: Finished difference. Result has 282 places, 282 transitions, 575 flow [2024-11-28 03:58:24,435 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-28 03:58:24,436 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-28 03:58:24,437 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 282 transitions, 575 flow [2024-11-28 03:58:24,438 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-28 03:58:24,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:24,439 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-28 03:58:24,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:58:24,439 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-28 03:58:24,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:24,440 INFO L85 PathProgramCache]: Analyzing trace with hash 479767889, now seen corresponding path program 1 times [2024-11-28 03:58:24,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:24,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631590601] [2024-11-28 03:58:24,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:24,588 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-28 03:58:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631590601] [2024-11-28 03:58:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631590601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:24,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:24,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578835181] [2024-11-28 03:58:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:24,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:24,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-28 03:58:24,611 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-28 03:58:24,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:24,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-28 03:58:24,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:24,722 INFO L124 PetriNetUnfolderBase]: 21/319 cut-off events. [2024-11-28 03:58:24,722 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-28 03:58:24,724 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-28 03:58:24,725 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 12 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-28 03:58:24,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 281 transitions, 601 flow [2024-11-28 03:58:24,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:24,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:24,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 921 transitions. [2024-11-28 03:58:24,729 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8924418604651163 [2024-11-28 03:58:24,729 INFO L175 Difference]: Start difference. First operand has 282 places, 282 transitions, 575 flow. Second operand 3 states and 921 transitions. [2024-11-28 03:58:24,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 281 transitions, 601 flow [2024-11-28 03:58:24,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 281 transitions, 597 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:24,735 INFO L231 Difference]: Finished difference. Result has 281 places, 281 transitions, 573 flow [2024-11-28 03:58:24,736 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-28 03:58:24,739 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -34 predicate places. [2024-11-28 03:58:24,740 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 281 transitions, 573 flow [2024-11-28 03:58:24,741 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-28 03:58:24,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:24,741 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-28 03:58:24,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:58:24,742 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-28 03:58:24,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:24,745 INFO L85 PathProgramCache]: Analyzing trace with hash 119216684, now seen corresponding path program 1 times [2024-11-28 03:58:24,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:24,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671863975] [2024-11-28 03:58:24,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:24,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:24,857 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-28 03:58:24,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:24,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671863975] [2024-11-28 03:58:24,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671863975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:24,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:24,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:24,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296411857] [2024-11-28 03:58:24,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:24,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:24,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:24,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:24,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:24,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-28 03:58:24,884 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-28 03:58:24,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:24,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-28 03:58:24,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:25,118 INFO L124 PetriNetUnfolderBase]: 70/670 cut-off events. [2024-11-28 03:58:25,118 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2024-11-28 03:58:25,121 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-28 03:58:25,124 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 16 selfloop transitions, 3 changer transitions 0/284 dead transitions. [2024-11-28 03:58:25,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 284 transitions, 619 flow [2024-11-28 03:58:25,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:25,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:25,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 927 transitions. [2024-11-28 03:58:25,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8982558139534884 [2024-11-28 03:58:25,127 INFO L175 Difference]: Start difference. First operand has 281 places, 281 transitions, 573 flow. Second operand 3 states and 927 transitions. [2024-11-28 03:58:25,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 284 transitions, 619 flow [2024-11-28 03:58:25,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:25,132 INFO L231 Difference]: Finished difference. Result has 279 places, 279 transitions, 571 flow [2024-11-28 03:58:25,132 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-28 03:58:25,133 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-28 03:58:25,133 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 279 transitions, 571 flow [2024-11-28 03:58:25,134 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-28 03:58:25,134 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:25,134 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-28 03:58:25,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:58:25,135 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-28 03:58:25,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:25,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1396853202, now seen corresponding path program 1 times [2024-11-28 03:58:25,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:25,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422874769] [2024-11-28 03:58:25,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:25,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:25,243 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-28 03:58:25,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:25,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422874769] [2024-11-28 03:58:25,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422874769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:25,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:25,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:25,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688749623] [2024-11-28 03:58:25,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:25,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:25,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:25,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:25,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:25,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-28 03:58:25,263 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-28 03:58:25,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:25,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-28 03:58:25,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:25,503 INFO L124 PetriNetUnfolderBase]: 76/765 cut-off events. [2024-11-28 03:58:25,503 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-28 03:58:25,507 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-28 03:58:25,510 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 19 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2024-11-28 03:58:25,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 287 transitions, 634 flow [2024-11-28 03:58:25,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:25,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 937 transitions. [2024-11-28 03:58:25,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9079457364341085 [2024-11-28 03:58:25,514 INFO L175 Difference]: Start difference. First operand has 279 places, 279 transitions, 571 flow. Second operand 3 states and 937 transitions. [2024-11-28 03:58:25,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 287 transitions, 634 flow [2024-11-28 03:58:25,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 278 places, 287 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:25,523 INFO L231 Difference]: Finished difference. Result has 279 places, 280 transitions, 577 flow [2024-11-28 03:58:25,524 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-28 03:58:25,524 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -36 predicate places. [2024-11-28 03:58:25,525 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 280 transitions, 577 flow [2024-11-28 03:58:25,525 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-28 03:58:25,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:25,526 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-28 03:58:25,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:58:25,526 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-28 03:58:25,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:25,527 INFO L85 PathProgramCache]: Analyzing trace with hash 780223954, now seen corresponding path program 1 times [2024-11-28 03:58:25,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:25,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096620733] [2024-11-28 03:58:25,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:25,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:25,916 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-28 03:58:25,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:25,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096620733] [2024-11-28 03:58:25,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096620733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:25,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:25,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 03:58:25,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586224909] [2024-11-28 03:58:25,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:25,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:58:25,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:25,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:58:25,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:58:26,517 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 344 [2024-11-28 03:58:26,519 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-28 03:58:26,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:26,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 344 [2024-11-28 03:58:26,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:27,341 INFO L124 PetriNetUnfolderBase]: 202/1252 cut-off events. [2024-11-28 03:58:27,342 INFO L125 PetriNetUnfolderBase]: For 110/110 co-relation queries the response was YES. [2024-11-28 03:58:27,348 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-28 03:58:27,354 INFO L140 encePairwiseOnDemand]: 315/344 looper letters, 52 selfloop transitions, 42 changer transitions 0/331 dead transitions. [2024-11-28 03:58:27,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 288 places, 331 transitions, 885 flow [2024-11-28 03:58:27,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-28 03:58:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-28 03:58:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2852 transitions. [2024-11-28 03:58:27,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8290697674418605 [2024-11-28 03:58:27,364 INFO L175 Difference]: Start difference. First operand has 279 places, 280 transitions, 577 flow. Second operand 10 states and 2852 transitions. [2024-11-28 03:58:27,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 288 places, 331 transitions, 885 flow [2024-11-28 03:58:27,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 288 places, 331 transitions, 885 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:58:27,373 INFO L231 Difference]: Finished difference. Result has 292 places, 305 transitions, 769 flow [2024-11-28 03:58:27,374 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-28 03:58:27,375 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-28 03:58:27,375 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 305 transitions, 769 flow [2024-11-28 03:58:27,377 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-28 03:58:27,377 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:27,377 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-28 03:58:27,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:58:27,378 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-28 03:58:27,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:27,379 INFO L85 PathProgramCache]: Analyzing trace with hash -89260748, now seen corresponding path program 1 times [2024-11-28 03:58:27,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:27,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449682240] [2024-11-28 03:58:27,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:27,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:27,477 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-28 03:58:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449682240] [2024-11-28 03:58:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449682240] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:27,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:27,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:27,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445107238] [2024-11-28 03:58:27,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:27,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:27,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:27,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:27,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:27,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2024-11-28 03:58:27,484 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-28 03:58:27,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:27,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2024-11-28 03:58:27,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:27,682 INFO L124 PetriNetUnfolderBase]: 90/783 cut-off events. [2024-11-28 03:58:27,682 INFO L125 PetriNetUnfolderBase]: For 77/80 co-relation queries the response was YES. [2024-11-28 03:58:27,684 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-28 03:58:27,687 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 11 selfloop transitions, 1 changer transitions 0/304 dead transitions. [2024-11-28 03:58:27,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 304 transitions, 791 flow [2024-11-28 03:58:27,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:27,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:27,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 930 transitions. [2024-11-28 03:58:27,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2024-11-28 03:58:27,689 INFO L175 Difference]: Start difference. First operand has 292 places, 305 transitions, 769 flow. Second operand 3 states and 930 transitions. [2024-11-28 03:58:27,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 304 transitions, 791 flow [2024-11-28 03:58:27,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 304 transitions, 791 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:58:27,698 INFO L231 Difference]: Finished difference. Result has 293 places, 304 transitions, 769 flow [2024-11-28 03:58:27,699 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-28 03:58:27,700 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-28 03:58:27,700 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 304 transitions, 769 flow [2024-11-28 03:58:27,701 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-28 03:58:27,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:27,701 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-28 03:58:27,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:58:27,701 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-28 03:58:27,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:27,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1976094477, now seen corresponding path program 1 times [2024-11-28 03:58:27,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:27,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384110337] [2024-11-28 03:58:27,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:27,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:27,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:27,784 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-28 03:58:27,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:27,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384110337] [2024-11-28 03:58:27,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384110337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:27,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:27,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:27,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867626882] [2024-11-28 03:58:27,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:27,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:27,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:27,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:27,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:27,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-28 03:58:27,799 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-28 03:58:27,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:27,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-28 03:58:27,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:28,088 INFO L124 PetriNetUnfolderBase]: 136/970 cut-off events. [2024-11-28 03:58:28,089 INFO L125 PetriNetUnfolderBase]: For 98/99 co-relation queries the response was YES. [2024-11-28 03:58:28,092 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-28 03:58:28,096 INFO L140 encePairwiseOnDemand]: 339/344 looper letters, 15 selfloop transitions, 2 changer transitions 28/307 dead transitions. [2024-11-28 03:58:28,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 307 transitions, 817 flow [2024-11-28 03:58:28,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:28,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 926 transitions. [2024-11-28 03:58:28,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8972868217054264 [2024-11-28 03:58:28,099 INFO L175 Difference]: Start difference. First operand has 293 places, 304 transitions, 769 flow. Second operand 3 states and 926 transitions. [2024-11-28 03:58:28,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 307 transitions, 817 flow [2024-11-28 03:58:28,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 307 transitions, 816 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:58:28,106 INFO L231 Difference]: Finished difference. Result has 292 places, 274 transitions, 644 flow [2024-11-28 03:58:28,107 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-28 03:58:28,107 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-28 03:58:28,108 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 274 transitions, 644 flow [2024-11-28 03:58:28,108 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-28 03:58:28,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:28,109 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-28 03:58:28,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:58:28,109 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-28 03:58:28,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:28,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2016087182, now seen corresponding path program 1 times [2024-11-28 03:58:28,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:28,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307297672] [2024-11-28 03:58:28,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:28,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:29,183 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-28 03:58:29,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:29,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307297672] [2024-11-28 03:58:29,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307297672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:29,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:29,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:58:29,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959551569] [2024-11-28 03:58:29,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:29,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:58:29,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:29,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:58:29,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:58:29,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-28 03:58:29,399 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-28 03:58:29,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:29,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-28 03:58:29,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:30,301 INFO L124 PetriNetUnfolderBase]: 231/1287 cut-off events. [2024-11-28 03:58:30,301 INFO L125 PetriNetUnfolderBase]: For 159/166 co-relation queries the response was YES. [2024-11-28 03:58:30,308 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-28 03:58:30,314 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 47 selfloop transitions, 10 changer transitions 0/299 dead transitions. [2024-11-28 03:58:30,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 299 transitions, 824 flow [2024-11-28 03:58:30,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:58:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:58:30,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-28 03:58:30,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-28 03:58:30,319 INFO L175 Difference]: Start difference. First operand has 292 places, 274 transitions, 644 flow. Second operand 6 states and 1773 transitions. [2024-11-28 03:58:30,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 299 transitions, 824 flow [2024-11-28 03:58:30,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 299 transitions, 768 flow, removed 8 selfloop flow, removed 9 redundant places. [2024-11-28 03:58:30,326 INFO L231 Difference]: Finished difference. Result has 282 places, 283 transitions, 668 flow [2024-11-28 03:58:30,327 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-28 03:58:30,327 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -33 predicate places. [2024-11-28 03:58:30,327 INFO L471 AbstractCegarLoop]: Abstraction has has 282 places, 283 transitions, 668 flow [2024-11-28 03:58:30,329 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-28 03:58:30,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:30,329 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-28 03:58:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:58:30,329 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-28 03:58:30,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:30,330 INFO L85 PathProgramCache]: Analyzing trace with hash -433205515, now seen corresponding path program 1 times [2024-11-28 03:58:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:30,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97054297] [2024-11-28 03:58:30,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:30,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:30,453 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-28 03:58:30,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:30,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97054297] [2024-11-28 03:58:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97054297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:30,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:30,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:30,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628997834] [2024-11-28 03:58:30,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:30,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:30,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:30,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:30,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:30,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-28 03:58:30,481 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-28 03:58:30,481 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:30,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-28 03:58:30,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:30,871 INFO L124 PetriNetUnfolderBase]: 255/1345 cut-off events. [2024-11-28 03:58:30,872 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2024-11-28 03:58:30,880 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-28 03:58:30,888 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 22 selfloop transitions, 2 changer transitions 0/288 dead transitions. [2024-11-28 03:58:30,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 288 transitions, 738 flow [2024-11-28 03:58:30,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-28 03:58:30,892 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-28 03:58:30,892 INFO L175 Difference]: Start difference. First operand has 282 places, 283 transitions, 668 flow. Second operand 3 states and 925 transitions. [2024-11-28 03:58:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 288 transitions, 738 flow [2024-11-28 03:58:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 288 transitions, 728 flow, removed 5 selfloop flow, removed 0 redundant places. [2024-11-28 03:58:30,899 INFO L231 Difference]: Finished difference. Result has 283 places, 282 transitions, 662 flow [2024-11-28 03:58:30,900 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-28 03:58:30,901 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-28 03:58:30,901 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 282 transitions, 662 flow [2024-11-28 03:58:30,902 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-28 03:58:30,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:30,902 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-28 03:58:30,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:58:30,903 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-28 03:58:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:30,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1570788794, now seen corresponding path program 1 times [2024-11-28 03:58:30,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:30,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562078282] [2024-11-28 03:58:30,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:30,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:31,049 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-28 03:58:31,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:31,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562078282] [2024-11-28 03:58:31,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562078282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:31,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:31,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:31,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235180817] [2024-11-28 03:58:31,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:31,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:31,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:31,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:31,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:31,061 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 344 [2024-11-28 03:58:31,062 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-28 03:58:31,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:31,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 344 [2024-11-28 03:58:31,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:31,380 INFO L124 PetriNetUnfolderBase]: 187/1151 cut-off events. [2024-11-28 03:58:31,381 INFO L125 PetriNetUnfolderBase]: For 405/416 co-relation queries the response was YES. [2024-11-28 03:58:31,389 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-28 03:58:31,395 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 21 selfloop transitions, 7 changer transitions 0/293 dead transitions. [2024-11-28 03:58:31,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 293 transitions, 764 flow [2024-11-28 03:58:31,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:31,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:31,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 935 transitions. [2024-11-28 03:58:31,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2024-11-28 03:58:31,398 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 662 flow. Second operand 3 states and 935 transitions. [2024-11-28 03:58:31,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 293 transitions, 764 flow [2024-11-28 03:58:31,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 293 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:31,406 INFO L231 Difference]: Finished difference. Result has 283 places, 287 transitions, 721 flow [2024-11-28 03:58:31,407 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-28 03:58:31,408 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -32 predicate places. [2024-11-28 03:58:31,408 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 287 transitions, 721 flow [2024-11-28 03:58:31,409 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-28 03:58:31,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:31,410 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-28 03:58:31,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:58:31,410 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-28 03:58:31,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1460093157, now seen corresponding path program 1 times [2024-11-28 03:58:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:31,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517047050] [2024-11-28 03:58:31,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:31,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:34,619 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-28 03:58:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:34,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517047050] [2024-11-28 03:58:34,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517047050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:34,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:34,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-28 03:58:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129975497] [2024-11-28 03:58:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:34,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:58:34,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:34,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:58:34,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:58:38,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 344 [2024-11-28 03:58:38,652 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-28 03:58:38,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:38,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 344 [2024-11-28 03:58:38,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:41,882 INFO L124 PetriNetUnfolderBase]: 672/2542 cut-off events. [2024-11-28 03:58:41,883 INFO L125 PetriNetUnfolderBase]: For 927/958 co-relation queries the response was YES. [2024-11-28 03:58:41,896 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-28 03:58:41,912 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 77 selfloop transitions, 35 changer transitions 0/318 dead transitions. [2024-11-28 03:58:41,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 318 transitions, 1037 flow [2024-11-28 03:58:41,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-28 03:58:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2024-11-28 03:58:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 8098 transitions. [2024-11-28 03:58:41,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7356468023255814 [2024-11-28 03:58:41,933 INFO L175 Difference]: Start difference. First operand has 283 places, 287 transitions, 721 flow. Second operand 32 states and 8098 transitions. [2024-11-28 03:58:41,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 318 transitions, 1037 flow [2024-11-28 03:58:41,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 318 transitions, 1037 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-28 03:58:41,942 INFO L231 Difference]: Finished difference. Result has 313 places, 286 transitions, 787 flow [2024-11-28 03:58:41,944 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-28 03:58:41,944 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -2 predicate places. [2024-11-28 03:58:41,944 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 286 transitions, 787 flow [2024-11-28 03:58:41,946 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-28 03:58:41,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:41,947 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-28 03:58:41,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:58:41,947 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-28 03:58:41,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:41,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1037906910, now seen corresponding path program 1 times [2024-11-28 03:58:41,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:41,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293737796] [2024-11-28 03:58:41,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:41,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:42,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:42,821 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-28 03:58:42,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:42,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293737796] [2024-11-28 03:58:42,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293737796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:42,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:42,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:58:42,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105103043] [2024-11-28 03:58:42,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:42,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:58:42,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:42,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:58:42,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:58:43,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 286 out of 344 [2024-11-28 03:58:43,068 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-28 03:58:43,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:43,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 286 of 344 [2024-11-28 03:58:43,068 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:43,745 INFO L124 PetriNetUnfolderBase]: 373/1726 cut-off events. [2024-11-28 03:58:43,745 INFO L125 PetriNetUnfolderBase]: For 1455/1463 co-relation queries the response was YES. [2024-11-28 03:58:43,755 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-28 03:58:43,762 INFO L140 encePairwiseOnDemand]: 336/344 looper letters, 56 selfloop transitions, 15 changer transitions 0/315 dead transitions. [2024-11-28 03:58:43,763 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 315 transitions, 1047 flow [2024-11-28 03:58:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:58:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:58:43,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1773 transitions. [2024-11-28 03:58:43,766 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8590116279069767 [2024-11-28 03:58:43,767 INFO L175 Difference]: Start difference. First operand has 313 places, 286 transitions, 787 flow. Second operand 6 states and 1773 transitions. [2024-11-28 03:58:43,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 315 transitions, 1047 flow [2024-11-28 03:58:43,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 315 transitions, 975 flow, removed 0 selfloop flow, removed 31 redundant places. [2024-11-28 03:58:43,775 INFO L231 Difference]: Finished difference. Result has 292 places, 299 transitions, 869 flow [2024-11-28 03:58:43,776 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-28 03:58:43,778 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -23 predicate places. [2024-11-28 03:58:43,778 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 299 transitions, 869 flow [2024-11-28 03:58:43,779 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-28 03:58:43,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:43,780 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-28 03:58:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 03:58:43,780 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-28 03:58:43,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:43,781 INFO L85 PathProgramCache]: Analyzing trace with hash -468623775, now seen corresponding path program 1 times [2024-11-28 03:58:43,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:43,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770790113] [2024-11-28 03:58:43,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:43,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:43,883 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-28 03:58:43,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770790113] [2024-11-28 03:58:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770790113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:58:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:58:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:58:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500115799] [2024-11-28 03:58:43,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:58:43,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:58:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:43,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:58:43,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:58:43,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 302 out of 344 [2024-11-28 03:58:43,905 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-28 03:58:43,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:43,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 302 of 344 [2024-11-28 03:58:43,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:44,440 INFO L124 PetriNetUnfolderBase]: 434/1617 cut-off events. [2024-11-28 03:58:44,440 INFO L125 PetriNetUnfolderBase]: For 3557/3613 co-relation queries the response was YES. [2024-11-28 03:58:44,454 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-28 03:58:44,470 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 36 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-28 03:58:44,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 305 transitions, 987 flow [2024-11-28 03:58:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:58:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:58:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 925 transitions. [2024-11-28 03:58:44,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8963178294573644 [2024-11-28 03:58:44,474 INFO L175 Difference]: Start difference. First operand has 292 places, 299 transitions, 869 flow. Second operand 3 states and 925 transitions. [2024-11-28 03:58:44,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 305 transitions, 987 flow [2024-11-28 03:58:44,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 305 transitions, 957 flow, removed 15 selfloop flow, removed 0 redundant places. [2024-11-28 03:58:44,488 INFO L231 Difference]: Finished difference. Result has 293 places, 298 transitions, 847 flow [2024-11-28 03:58:44,489 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-28 03:58:44,490 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, -22 predicate places. [2024-11-28 03:58:44,490 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 298 transitions, 847 flow [2024-11-28 03:58:44,490 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-28 03:58:44,490 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:44,491 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-28 03:58:44,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:58:44,491 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-28 03:58:44,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:44,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1935256271, now seen corresponding path program 1 times [2024-11-28 03:58:44,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:44,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498929307] [2024-11-28 03:58:44,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:44,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:46,556 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-28 03:58:46,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:46,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498929307] [2024-11-28 03:58:46,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498929307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:58:46,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1934601686] [2024-11-28 03:58:46,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:58:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:58:46,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:58:46,562 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:58:46,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:58:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:58:46,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-28 03:58:46,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:58:46,892 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-28 03:58:47,057 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:58:47,058 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-28 03:58:47,663 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-28 03:58:47,664 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-28 03:58:47,689 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 03:58:47,689 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-28 03:58:47,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-28 03:58:47,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:58:48,052 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-28 03:58:48,052 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-28 03:58:48,216 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-28 03:58:48,216 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-28 03:58:48,240 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-28 03:58:48,348 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:58:48,349 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-28 03:58:48,425 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:58:48,426 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-28 03:58:48,508 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:58:48,508 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-28 03:58:49,025 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-28 03:58:49,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1934601686] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:58:49,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:58:49,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 21 [2024-11-28 03:58:49,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703772475] [2024-11-28 03:58:49,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:58:49,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-28 03:58:49,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:58:49,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-28 03:58:49,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2024-11-28 03:58:52,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 258 out of 344 [2024-11-28 03:58:52,451 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-28 03:58:52,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:58:52,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 258 of 344 [2024-11-28 03:58:52,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:58:55,493 INFO L124 PetriNetUnfolderBase]: 1346/5268 cut-off events. [2024-11-28 03:58:55,493 INFO L125 PetriNetUnfolderBase]: For 5589/5971 co-relation queries the response was YES. [2024-11-28 03:58:55,532 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-28 03:58:55,554 INFO L140 encePairwiseOnDemand]: 312/344 looper letters, 111 selfloop transitions, 58 changer transitions 0/388 dead transitions. [2024-11-28 03:58:55,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 388 transitions, 1728 flow [2024-11-28 03:58:55,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-28 03:58:55,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2024-11-28 03:58:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 6556 transitions. [2024-11-28 03:58:55,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7623255813953488 [2024-11-28 03:58:55,565 INFO L175 Difference]: Start difference. First operand has 293 places, 298 transitions, 847 flow. Second operand 25 states and 6556 transitions. [2024-11-28 03:58:55,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 388 transitions, 1728 flow [2024-11-28 03:58:55,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 388 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:58:55,585 INFO L231 Difference]: Finished difference. Result has 320 places, 330 transitions, 1268 flow [2024-11-28 03:58:55,585 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-28 03:58:55,586 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 5 predicate places. [2024-11-28 03:58:55,587 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 330 transitions, 1268 flow [2024-11-28 03:58:55,589 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-28 03:58:55,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:58:55,589 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-28 03:58:55,601 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:58:55,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-28 03:58:55,794 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-28 03:58:55,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:58:55,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1390206865, now seen corresponding path program 2 times [2024-11-28 03:58:55,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:58:55,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247698280] [2024-11-28 03:58:55,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:58:55,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:58:55,898 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:58:55,899 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:58:58,072 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-28 03:58:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:58:58,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247698280] [2024-11-28 03:58:58,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247698280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:58:58,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276770403] [2024-11-28 03:58:58,075 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:58:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:58:58,075 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:58:58,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:58:58,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:58:58,643 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:58:58,643 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:58:58,647 INFO L256 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 03:58:58,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:58:58,664 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-28 03:58:58,903 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:58:58,903 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-28 03:58:59,561 INFO L349 Elim1Store]: treesize reduction 648, result has 5.1 percent of original size [2024-11-28 03:58:59,561 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-28 03:58:59,583 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-28 03:58:59,584 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-28 03:58:59,609 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-28 03:58:59,609 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:58:59,884 INFO L349 Elim1Store]: treesize reduction 764, result has 11.9 percent of original size [2024-11-28 03:58:59,884 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-28 03:58:59,999 INFO L349 Elim1Store]: treesize reduction 200, result has 30.6 percent of original size [2024-11-28 03:58:59,999 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-28 03:59:00,029 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-28 03:59:00,090 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:59:00,090 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-28 03:59:00,161 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:59:00,162 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-28 03:59:00,218 INFO L349 Elim1Store]: treesize reduction 866, result has 0.1 percent of original size [2024-11-28 03:59:00,218 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-28 03:59:00,686 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-28 03:59:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276770403] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:00,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:59:00,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14, 14] total 37 [2024-11-28 03:59:00,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055182569] [2024-11-28 03:59:00,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:00,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-28 03:59:00,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:00,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-28 03:59:00,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1298, Unknown=0, NotChecked=0, Total=1406 [2024-11-28 03:59:07,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 344 [2024-11-28 03:59:07,615 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-28 03:59:07,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:59:07,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 344 [2024-11-28 03:59:07,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:59:12,693 INFO L124 PetriNetUnfolderBase]: 2371/8176 cut-off events. [2024-11-28 03:59:12,693 INFO L125 PetriNetUnfolderBase]: For 15522/17068 co-relation queries the response was YES. [2024-11-28 03:59:12,736 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-28 03:59:12,783 INFO L140 encePairwiseOnDemand]: 291/344 looper letters, 144 selfloop transitions, 105 changer transitions 0/426 dead transitions. [2024-11-28 03:59:12,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 426 transitions, 2453 flow [2024-11-28 03:59:12,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-28 03:59:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2024-11-28 03:59:12,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 7708 transitions. [2024-11-28 03:59:12,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6055939660590823 [2024-11-28 03:59:12,801 INFO L175 Difference]: Start difference. First operand has 320 places, 330 transitions, 1268 flow. Second operand 37 states and 7708 transitions. [2024-11-28 03:59:12,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 426 transitions, 2453 flow [2024-11-28 03:59:12,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 426 transitions, 2408 flow, removed 0 selfloop flow, removed 18 redundant places. [2024-11-28 03:59:12,841 INFO L231 Difference]: Finished difference. Result has 343 places, 369 transitions, 1882 flow [2024-11-28 03:59:12,842 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-28 03:59:12,843 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 28 predicate places. [2024-11-28 03:59:12,843 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 369 transitions, 1882 flow [2024-11-28 03:59:12,850 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-28 03:59:12,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:59:12,851 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-28 03:59:12,865 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:59:13,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:13,052 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-28 03:59:13,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:13,053 INFO L85 PathProgramCache]: Analyzing trace with hash -220630722, now seen corresponding path program 1 times [2024-11-28 03:59:13,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:13,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247956891] [2024-11-28 03:59:13,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:13,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:13,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:13,493 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-28 03:59:13,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:13,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247956891] [2024-11-28 03:59:13,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247956891] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:59:13,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1313685296] [2024-11-28 03:59:13,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:13,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:13,494 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:13,498 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:13,503 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:59:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:13,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:59:13,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:14,263 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-28 03:59:14,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:14,847 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-28 03:59:14,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1313685296] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:14,848 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:59:14,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-28 03:59:14,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233871848] [2024-11-28 03:59:14,848 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:14,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:59:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:14,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:59:14,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:59:16,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-28 03:59:16,494 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-28 03:59:16,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:59:16,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-28 03:59:16,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:59:20,647 INFO L124 PetriNetUnfolderBase]: 4136/14365 cut-off events. [2024-11-28 03:59:20,647 INFO L125 PetriNetUnfolderBase]: For 28360/32459 co-relation queries the response was YES. [2024-11-28 03:59:20,749 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-28 03:59:20,829 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 164 selfloop transitions, 97 changer transitions 2/522 dead transitions. [2024-11-28 03:59:20,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 365 places, 522 transitions, 3281 flow [2024-11-28 03:59:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:59:20,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-28 03:59:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6236 transitions. [2024-11-28 03:59:20,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881698685540951 [2024-11-28 03:59:20,840 INFO L175 Difference]: Start difference. First operand has 343 places, 369 transitions, 1882 flow. Second operand 23 states and 6236 transitions. [2024-11-28 03:59:20,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 365 places, 522 transitions, 3281 flow [2024-11-28 03:59:20,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 522 transitions, 3092 flow, removed 41 selfloop flow, removed 29 redundant places. [2024-11-28 03:59:20,947 INFO L231 Difference]: Finished difference. Result has 349 places, 433 transitions, 2397 flow [2024-11-28 03:59:20,949 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-28 03:59:20,949 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 34 predicate places. [2024-11-28 03:59:20,950 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 433 transitions, 2397 flow [2024-11-28 03:59:20,952 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-28 03:59:20,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:59:20,952 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-28 03:59:20,964 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:59:21,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:21,153 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-28 03:59:21,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:21,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1695107886, now seen corresponding path program 1 times [2024-11-28 03:59:21,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:21,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17302497] [2024-11-28 03:59:21,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:21,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:22,061 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-28 03:59:22,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17302497] [2024-11-28 03:59:22,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17302497] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:59:22,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867860294] [2024-11-28 03:59:22,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:59:22,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:22,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:22,064 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:22,068 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:59:22,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:59:22,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-28 03:59:22,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:22,940 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-28 03:59:22,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:23,525 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-28 03:59:23,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867860294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:59:23,529 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:59:23,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-28 03:59:23,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253582776] [2024-11-28 03:59:23,529 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:59:23,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 03:59:23,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:59:23,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 03:59:23,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=434, Unknown=0, NotChecked=0, Total=552 [2024-11-28 03:59:25,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 344 [2024-11-28 03:59:25,498 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-28 03:59:25,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:59:25,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 344 [2024-11-28 03:59:25,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:59:29,408 INFO L124 PetriNetUnfolderBase]: 2275/10372 cut-off events. [2024-11-28 03:59:29,408 INFO L125 PetriNetUnfolderBase]: For 25808/26076 co-relation queries the response was YES. [2024-11-28 03:59:29,479 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-28 03:59:29,506 INFO L140 encePairwiseOnDemand]: 302/344 looper letters, 96 selfloop transitions, 44 changer transitions 151/544 dead transitions. [2024-11-28 03:59:29,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 544 transitions, 3808 flow [2024-11-28 03:59:29,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-28 03:59:29,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2024-11-28 03:59:29,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 6240 transitions. [2024-11-28 03:59:29,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788675429726997 [2024-11-28 03:59:29,514 INFO L175 Difference]: Start difference. First operand has 349 places, 433 transitions, 2397 flow. Second operand 23 states and 6240 transitions. [2024-11-28 03:59:29,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 544 transitions, 3808 flow [2024-11-28 03:59:29,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 544 transitions, 3768 flow, removed 15 selfloop flow, removed 1 redundant places. [2024-11-28 03:59:29,692 INFO L231 Difference]: Finished difference. Result has 374 places, 380 transitions, 2080 flow [2024-11-28 03:59:29,692 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-28 03:59:29,693 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 59 predicate places. [2024-11-28 03:59:29,693 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 380 transitions, 2080 flow [2024-11-28 03:59:29,694 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-28 03:59:29,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:59:29,695 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-28 03:59:29,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:59:29,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-28 03:59:29,895 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-28 03:59:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:59:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash 247141950, now seen corresponding path program 2 times [2024-11-28 03:59:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:59:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870706054] [2024-11-28 03:59:29,897 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:59:29,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:59:30,030 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:59:30,031 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:59:35,041 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-28 03:59:35,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:59:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870706054] [2024-11-28 03:59:35,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870706054] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:59:35,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547200980] [2024-11-28 03:59:35,041 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:59:35,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:59:35,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:59:35,043 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:59:35,044 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:59:36,185 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 03:59:36,185 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:59:36,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-28 03:59:36,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:59:36,204 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-28 03:59:36,531 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 03:59:36,531 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-28 03:59:37,146 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 03:59:37,147 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-28 03:59:38,345 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-28 03:59:38,450 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-28 03:59:38,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:59:38,561 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-28 03:59:38,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:59:38,700 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-28 03:59:38,993 INFO L349 Elim1Store]: treesize reduction 70, result has 33.3 percent of original size [2024-11-28 03:59:38,993 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-28 03:59:39,005 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-28 03:59:39,341 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-28 03:59:39,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:59:43,396 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-28 04:00:18,758 INFO L349 Elim1Store]: treesize reduction 1170, result has 8.1 percent of original size [2024-11-28 04:00:18,759 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-28 04:00:18,763 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-28 04:00:18,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:18,780 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-28 04:00:18,822 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:18,823 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-28 04:00:18,964 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:00:18,964 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-28 04:00:19,123 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:00:19,216 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:00:19,216 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-28 04:00:19,219 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:00:19,325 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:00:19,325 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-28 04:00:19,328 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:00:19,418 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:00:19,419 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-28 04:00:36,051 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-28 04:00:36,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547200980] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:00:36,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:00:36,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 25, 16] total 70 [2024-11-28 04:00:36,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660157007] [2024-11-28 04:00:36,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:00:36,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2024-11-28 04:00:36,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:00:36,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2024-11-28 04:00:36,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=4523, Unknown=34, NotChecked=136, Total=4970 [2024-11-28 04:00:37,075 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 344 [2024-11-28 04:00:37,085 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-28 04:00:37,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:00:37,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 344 [2024-11-28 04:00:37,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:01:07,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:02:24,313 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-28 04:02:30,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:03:13,864 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-28 04:03:16,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:03:18,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:03:34,387 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-28 04:03:51,139 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-28 04:04:06,963 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-28 04:04:14,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:04:32,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:04:56,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:05:01,140 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-28 04:06:11,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:06:50,858 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-28 04:06:57,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:07:02,903 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-28 04:07:08,655 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-28 04:07:45,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:07:53,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:08:03,573 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-28 04:08:05,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:08:27,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:08:37,322 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-28 04:09:26,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:09:34,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:09:54,410 INFO L124 PetriNetUnfolderBase]: 28061/51893 cut-off events. [2024-11-28 04:09:54,411 INFO L125 PetriNetUnfolderBase]: For 102218/102387 co-relation queries the response was YES. [2024-11-28 04:09:54,816 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-28 04:09:54,985 INFO L140 encePairwiseOnDemand]: 275/344 looper letters, 678 selfloop transitions, 455 changer transitions 28/1296 dead transitions. [2024-11-28 04:09:54,986 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 1296 transitions, 10299 flow [2024-11-28 04:09:54,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2024-11-28 04:09:54,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2024-11-28 04:09:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 15665 transitions. [2024-11-28 04:09:55,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47435198643410853 [2024-11-28 04:09:55,010 INFO L175 Difference]: Start difference. First operand has 374 places, 380 transitions, 2080 flow. Second operand 96 states and 15665 transitions. [2024-11-28 04:09:55,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 1296 transitions, 10299 flow [2024-11-28 04:09:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 1296 transitions, 9665 flow, removed 176 selfloop flow, removed 28 redundant places. [2024-11-28 04:09:56,422 INFO L231 Difference]: Finished difference. Result has 452 places, 783 transitions, 6929 flow [2024-11-28 04:09:56,422 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-28 04:09:56,423 INFO L279 CegarLoopForPetriNet]: 315 programPoint places, 137 predicate places. [2024-11-28 04:09:56,423 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 783 transitions, 6929 flow [2024-11-28 04:09:56,425 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-28 04:09:56,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 04:09:56,425 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-28 04:09:56,437 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:09:56,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:09:56,629 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-28 04:09:56,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:09:56,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1100709826, now seen corresponding path program 3 times [2024-11-28 04:09:56,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:09:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938787479] [2024-11-28 04:09:56,632 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:09:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:09:56,976 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:09:56,976 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:10:11,409 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-28 04:10:11,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:10:11,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938787479] [2024-11-28 04:10:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938787479] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:10:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356873572] [2024-11-28 04:10:11,410 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-28 04:10:11,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:10:11,410 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:10:11,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:10:11,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e4c6de7b-4452-46b9-b522-1ef613482bbe/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 04:10:13,855 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-28 04:10:13,855 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:10:13,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-28 04:10:13,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:10:13,884 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-28 04:10:14,590 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:10:14,590 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-28 04:10:15,968 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-28 04:10:15,969 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-28 04:10:18,058 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-28 04:10:18,214 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-28 04:10:18,405 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-28 04:10:18,954 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-28 04:10:19,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:10:19,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:10:19,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:10:19,320 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 04:10:19,322 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-28 04:10:19,330 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-28 04:10:19,622 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-28 04:10:19,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:10:34,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse10 (+ 3 .cse4 c_~B~0.offset))) (let ((.cse1 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse10 0)))) (let ((.cse3 (select .cse1 c_~A~0.base)) (.cse5 (+ |c_thread2Thread1of1ForFork1_#t~post10| 1))) (and (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int)) (or (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store (let ((.cse2 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse0 (store (store (store (store .cse3 (+ c_~A~0.offset .cse2) 0) (+ c_~A~0.offset .cse2 1) 0) (+ c_~A~0.offset 2 .cse2) 0) (+ c_~A~0.offset 3 .cse2) 0))) (store (store |c_#race| c_~A~0.base .cse0) c_~B~0.base (store (store (store (store (select (store .cse1 c_~A~0.base .cse0) c_~B~0.base) (+ .cse2 c_~B~0.offset) 0) (+ .cse2 c_~B~0.offset 1) 0) (+ 2 .cse2 c_~B~0.offset) 0) (+ 3 .cse2 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) (+ 2 .cse4 c_~B~0.offset)) 0)) (< v_thread2Thread1of1ForFork1_~i~1_35 .cse5))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int)) (or (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store (let ((.cse7 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse6 (store (store (store (store .cse3 (+ 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 .cse1 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) (+ .cse4 c_~B~0.offset)) 0)) (< v_thread2Thread1of1ForFork1_~i~1_35 .cse5))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int)) (or (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store (let ((.cse9 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse8 (store (store (store (store .cse3 (+ 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 .cse1 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)) (< v_thread2Thread1of1ForFork1_~i~1_35 .cse5))) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int)) (or (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store (let ((.cse12 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse11 (store (store (store (store .cse3 (+ 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 .cse1 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) (+ .cse4 c_~B~0.offset 1)) 0)) (< v_thread2Thread1of1ForFork1_~i~1_35 .cse5)))))))) is different from false [2024-11-28 04:10:35,355 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-28 04:10:39,615 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-28 04:11:09,603 INFO L349 Elim1Store]: treesize reduction 1170, result has 8.1 percent of original size [2024-11-28 04:11:09,604 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-28 04:11:09,611 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-28 04:11:09,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:09,626 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-28 04:11:09,665 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-28 04:11:09,835 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:11:09,835 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-28 04:11:10,125 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:10,227 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:11:10,227 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-28 04:11:10,230 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:10,320 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:11:10,321 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-28 04:11:10,324 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:11:10,422 INFO L349 Elim1Store]: treesize reduction 1272, result has 0.1 percent of original size [2024-11-28 04:11:10,423 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-28 04:11:25,548 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-28 04:11:25,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356873572] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:11:25,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:11:25,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 18] total 66 [2024-11-28 04:11:25,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835516530] [2024-11-28 04:11:25,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:11:25,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2024-11-28 04:11:25,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:11:25,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2024-11-28 04:11:25,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=3719, Unknown=64, NotChecked=378, Total=4422 [2024-11-28 04:11:28,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 344 [2024-11-28 04:11:29,013 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-28 04:11:29,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 04:11:29,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 344 [2024-11-28 04:11:29,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 04:12:17,966 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 [0] [2024-11-28 04:12:23,662 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 [0] [2024-11-28 04:12:28,755 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_thread1Thread1of1ForFork0_~i~0 4))) (let ((.cse35 (* c_thread2Thread1of1ForFork1_~i~1 4)) (.cse9 (select |c_#race| c_~B~0.base)) (.cse11 (+ .cse10 c_~B~0.offset 1)) (.cse7 (+ 2 .cse10 c_~B~0.offset)) (.cse14 (+ 3 .cse10 c_~B~0.offset))) (let ((.cse2 (store |c_#race| c_~B~0.base (store (store (store .cse9 .cse11 0) .cse7 0) .cse14 0))) (.cse26 (+ .cse35 c_~B~0.offset)) (.cse27 (+ .cse35 c_~B~0.offset 1)) (.cse28 (+ .cse35 2 c_~B~0.offset)) (.cse29 (+ .cse35 3 c_~B~0.offset)) (.cse30 (+ c_~A~0.offset .cse35)) (.cse31 (+ c_~A~0.offset .cse35 1)) (.cse32 (+ c_~A~0.offset .cse35 2)) (.cse33 (+ c_~A~0.offset .cse35 3))) (let ((.cse6 (let ((.cse34 (store |c_#race| c_~A~0.base (store (store (store (store (select |c_#race| c_~A~0.base) .cse30 0) .cse31 0) .cse32 0) .cse33 0)))) (store .cse34 c_~B~0.base (store (store (store (store (select .cse34 c_~B~0.base) .cse26 0) .cse27 0) .cse28 0) .cse29 0)))) (.cse5 (+ .cse10 c_~B~0.offset)) (.cse0 (+ c_thread2Thread1of1ForFork1_~i~1 1)) (.cse4 (select .cse2 c_~A~0.base)) (.cse8 (let ((.cse25 (store |c_#race| c_~B~0.base (store .cse9 .cse14 0)))) (let ((.cse24 (store (store (store (store (select .cse25 c_~A~0.base) .cse30 0) .cse31 0) .cse32 0) .cse33 0))) (store (store |c_#race| c_~A~0.base .cse24) c_~B~0.base (store (store (store (store (select (store .cse25 c_~A~0.base .cse24) c_~B~0.base) .cse26 0) .cse27 0) .cse28 0) .cse29 0)))))) (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) 0))) (= (select |c_#valid| |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|) 1) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse6 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse7) 0)) (= |c_ULTIMATE.start_create_fresh_uint_array_#res#1.offset| 0) (<= c_thread1Thread1of1ForFork0_~i~0 0) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse8 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse5) 0)) (= (select .cse9 (+ .cse10 1)) 0) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse6 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse11) 0)) (= (select |c_#valid| c_~B~0.base) 1) (not (= c_~C~0.base c_~A~0.base)) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse13 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse12 (store (store (store (store .cse4 (+ c_~A~0.offset .cse13) 0) (+ c_~A~0.offset .cse13 1) 0) (+ c_~A~0.offset 2 .cse13) 0) (+ c_~A~0.offset 3 .cse13) 0))) (store (store |c_#race| c_~A~0.base .cse12) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse12) c_~B~0.base) (+ .cse13 c_~B~0.offset) 0) (+ .cse13 c_~B~0.offset 1) 0) (+ 2 .cse13 c_~B~0.offset) 0) (+ 3 .cse13 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse14) 0))) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse6 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse14) 0)) (= c_~B~0.offset 0) (= c_~A~0.offset 0) (= (select .cse9 (+ 2 .cse10)) 0) (not (= c_~B~0.base c_~C~0.base)) (not (= c_~B~0.base c_~A~0.base)) (forall ((v_ArrVal_1491 (Array Int Int))) (= 0 (select (select (store .cse8 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse14))) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse8 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse11) 0)) (= (select .cse9 .cse10) 0) (= (select |c_#valid| c_~A~0.base) 1) (forall ((v_thread2Thread1of1ForFork1_~i~1_35 Int) (v_ArrVal_1491 (Array Int Int))) (or (< v_thread2Thread1of1ForFork1_~i~1_35 .cse0) (= (select (select (store (let ((.cse16 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse15 (store (store (store (store .cse4 (+ c_~A~0.offset .cse16) 0) (+ c_~A~0.offset .cse16 1) 0) (+ c_~A~0.offset 2 .cse16) 0) (+ c_~A~0.offset 3 .cse16) 0))) (store (store |c_#race| c_~A~0.base .cse15) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse15) c_~B~0.base) (+ .cse16 c_~B~0.offset) 0) (+ .cse16 c_~B~0.offset 1) 0) (+ 2 .cse16 c_~B~0.offset) 0) (+ 3 .cse16 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse11) 0))) (not (= c_~B~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse6 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse5) 0)) (exists ((thread2Thread1of1ForFork1_~i~1 Int) (~A~0.base Int)) (let ((.cse17 (* thread2Thread1of1ForFork1_~i~1 4))) (let ((.cse18 (+ 2 .cse17)) (.cse19 (select |c_#race| ~A~0.base)) (.cse21 (+ .cse17 1)) (.cse20 (+ 3 .cse17))) (and (= (select .cse9 .cse17) 0) (= (select .cse9 .cse18) 0) (= (select .cse19 .cse18) 0) (= (select .cse19 .cse20) 0) (<= 1 thread2Thread1of1ForFork1_~i~1) (= (select .cse19 .cse21) 0) (= (select .cse19 .cse17) 0) (= (select .cse9 .cse21) 0) (not (= ~A~0.base c_~B~0.base)) (= (select .cse9 .cse20) 0))))) (= (select .cse9 (+ 3 .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 ((.cse23 (* v_thread2Thread1of1ForFork1_~i~1_35 4))) (let ((.cse22 (store (store (store (store .cse4 (+ c_~A~0.offset .cse23) 0) (+ c_~A~0.offset .cse23 1) 0) (+ c_~A~0.offset 2 .cse23) 0) (+ c_~A~0.offset 3 .cse23) 0))) (store (store |c_#race| c_~A~0.base .cse22) c_~B~0.base (store (store (store (store (select (store .cse2 c_~A~0.base .cse22) c_~B~0.base) (+ .cse23 c_~B~0.offset) 0) (+ .cse23 c_~B~0.offset 1) 0) (+ 2 .cse23 c_~B~0.offset) 0) (+ 3 .cse23 c_~B~0.offset) 0)))) c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse7) 0))) (not (= c_~A~0.base |c_ULTIMATE.start_create_fresh_uint_array_#res#1.base|)) (forall ((v_ArrVal_1491 (Array Int Int))) (= (select (select (store .cse8 c_~C~0.base v_ArrVal_1491) c_~B~0.base) .cse7) 0))))))) is different from true [2024-11-28 04:12:35,202 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-28 04:12:46,384 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 [0]