./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-ext/08_rand_cas-race.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash adb74bb4036ab42451aee4c4c2c855416fb34747e80c1114ce822e44c6b19376 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:10:07,306 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:10:07,347 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:10:07,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:10:07,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:10:07,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:10:07,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:10:07,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:10:07,371 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:10:07,371 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:10:07,371 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:10:07,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:10:07,371 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:10:07,372 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:10:07,372 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:10:07,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:07,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:10:07,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:10:07,373 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 -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> adb74bb4036ab42451aee4c4c2c855416fb34747e80c1114ce822e44c6b19376 [2025-02-08 05:10:07,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:10:07,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:10:07,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:10:07,589 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:10:07,589 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:10:07,590 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/08_rand_cas-race.i [2025-02-08 05:10:08,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4c0f3512/47a8a6d6bed34cbd8d0245b383ea39d3/FLAGb53f80f0f [2025-02-08 05:10:08,950 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:10:08,950 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas-race.i [2025-02-08 05:10:08,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4c0f3512/47a8a6d6bed34cbd8d0245b383ea39d3/FLAGb53f80f0f [2025-02-08 05:10:08,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b4c0f3512/47a8a6d6bed34cbd8d0245b383ea39d3 [2025-02-08 05:10:08,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:10:08,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:10:08,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:08,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:10:08,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:10:08,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:08" (1/1) ... [2025-02-08 05:10:08,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d5ad031 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:08, skipping insertion in model container [2025-02-08 05:10:08,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:08" (1/1) ... [2025-02-08 05:10:09,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:10:09,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:09,284 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:10:09,317 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:09,346 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:10:09,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09 WrapperNode [2025-02-08 05:10:09,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:09,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:09,348 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:10:09,348 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:10:09,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,377 INFO L138 Inliner]: procedures = 176, calls = 34, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 209 [2025-02-08 05:10:09,378 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:09,378 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:10:09,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:10:09,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:10:09,387 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,390 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,390 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,399 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,400 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,402 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,403 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,405 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:10:09,406 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:10:09,406 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:10:09,406 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:10:09,407 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (1/1) ... [2025-02-08 05:10:09,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:09,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:09,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:10:09,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:10:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:10:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:10:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:10:09,457 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:10:09,535 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:10:09,537 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:10:09,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729: havoc PseudoRandomUsingAtomic_nextInt_#t~ret11#1; [2025-02-08 05:10:09,774 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-1: PseudoRandomUsingAtomic_nextInt_~nexts~0#1 := PseudoRandomUsingAtomic_nextInt_#t~ret11#1; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-2: assume { :end_inline_calculateNext } true;assume -2147483648 <= PseudoRandomUsingAtomic_nextInt_#t~ret11#1 && PseudoRandomUsingAtomic_nextInt_#t~ret11#1 <= 2147483647; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-3: havoc calculateNext_#in~s2#1; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-4: havoc calculateNext_#t~nondet3#1, calculateNext_~s2#1, calculateNext_~calculateNext_return~0#1; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L729-5: PseudoRandomUsingAtomic_nextInt_#t~ret11#1 := calculateNext_#res#1; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume !(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-2: assume !!(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L730-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731: [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-1: havoc __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset;assume { :end_inline___VERIFIER_atomic_CAS } true; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-2: havoc __VERIFIER_atomic_CAS_#t~mem6#1, __VERIFIER_atomic_CAS_#t~nondet7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-3: havoc __VERIFIER_atomic_CAS_#t~mem6#1, __VERIFIER_atomic_CAS_#t~nondet7#1, __VERIFIER_atomic_CAS_#t~nondet8#1, __VERIFIER_atomic_CAS_#t~nondet9#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, __VERIFIER_atomic_CAS_~e#1, __VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset; [2025-02-08 05:10:09,775 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L731-4: assume { :begin_inline___VERIFIER_atomic_CAS } true;__VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset, __VERIFIER_atomic_CAS_#in~e#1, __VERIFIER_atomic_CAS_#in~u#1, __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset := ~#seed~0.base, ~#seed~0.offset, PseudoRandomUsingAtomic_nextInt_~read~0#1, PseudoRandomUsingAtomic_nextInt_~nexts~0#1, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume __VERIFIER_atomic_CAS_#t~mem6#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715: assume !(__VERIFIER_atomic_CAS_#t~mem6#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: havoc __VERIFIER_atomic_CAS_#t~mem6#1; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-2: havoc __VERIFIER_atomic_CAS_#t~mem6#1; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-3: assume ((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-3: assume !(((0 == #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset]) && 0 == #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset]); [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-4: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-5: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-6: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:09,776 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-7: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-8: SUMMARY for call __VERIFIER_atomic_CAS_#t~mem6#1 := read~int(__VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: assume 1 == PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732: assume !(1 == PseudoRandomUsingAtomic_nextInt_#t~mem12#1); [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-1: havoc PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-2: havoc PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-3: assume ((0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset] && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-3: assume !(((0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset] && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]) && 0 == #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset]); [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-4: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-5: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-6: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-7: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L732-8: SUMMARY for call PseudoRandomUsingAtomic_nextInt_#t~mem12#1 := read~int(PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset, 4); srcloc: null [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1 := (if PseudoRandomUsingAtomic_nextInt_~nexts~0#1 < 0 && 0 != PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 then (if PseudoRandomUsingAtomic_nextInt_~n#1 < 0 then PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 + PseudoRandomUsingAtomic_nextInt_~n#1 else PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1 - PseudoRandomUsingAtomic_nextInt_~n#1) else PseudoRandomUsingAtomic_nextInt_~nexts~0#1 % PseudoRandomUsingAtomic_nextInt_~n#1); [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:10:09,777 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet8#1); [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-2: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-6: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet8#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-7: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-8: SUMMARY for call write~int(1, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-9: assume ((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-9: assume !(((#race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1 && #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1) && #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset] == __VERIFIER_atomic_CAS_#t~nondet7#1); [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-10: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-11: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-12: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-13: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#t~nondet7#1]; [2025-02-08 05:10:09,778 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-14: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-15: SUMMARY for call write~int(__VERIFIER_atomic_CAS_~u#1, __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset, 4); srcloc: null [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753: havoc PseudoRandomUsingAtomic__threadmain_#t~ret15#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-1: PseudoRandomUsingAtomic__threadmain_~myrand~0#1 := PseudoRandomUsingAtomic__threadmain_#t~ret15#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-2: assume { :end_inline_PseudoRandomUsingAtomic_nextInt } true;assume -2147483648 <= PseudoRandomUsingAtomic__threadmain_#t~ret15#1 && PseudoRandomUsingAtomic__threadmain_#t~ret15#1 <= 2147483647; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-3: havoc PseudoRandomUsingAtomic_nextInt_#in~n#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-4: havoc PseudoRandomUsingAtomic_nextInt_#t~mem10#1, PseudoRandomUsingAtomic_nextInt_#t~ret11#1, PseudoRandomUsingAtomic_nextInt_#t~mem12#1, PseudoRandomUsingAtomic_nextInt_~n#1, PseudoRandomUsingAtomic_nextInt_~read~0#1, PseudoRandomUsingAtomic_nextInt_~nexts~0#1, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset, PseudoRandomUsingAtomic_nextInt_~nextInt_return~0#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L753-5: PseudoRandomUsingAtomic__threadmain_#t~ret15#1 := PseudoRandomUsingAtomic_nextInt_#res#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L770: havoc PseudoRandomUsingAtomic__threadmain_#t~ret15#1, PseudoRandomUsingAtomic__threadmain_~myrand~0#1;assume { :end_inline_PseudoRandomUsingAtomic__threadmain } true; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: assume ((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721: assume !(((#race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1 && #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1) && #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset] == __VERIFIER_atomic_CAS_#t~nondet9#1); [2025-02-08 05:10:09,779 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-2: assume !(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-2: assume !!(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-1: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L754-3: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-2: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,3 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-3: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,2 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-4: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,1 + __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-5: #race := #race[__VERIFIER_atomic_CAS_~r#1.base,__VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#t~nondet9#1]; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-6: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L721-7: SUMMARY for call write~int(0, __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset, 4); srcloc: null [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: __VERIFIER_atomic_CAS_~r#1.base, __VERIFIER_atomic_CAS_~r#1.offset := __VERIFIER_atomic_CAS_#in~r#1.base, __VERIFIER_atomic_CAS_#in~r#1.offset; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L709-3: __VERIFIER_atomic_CAS_~v#1.base, __VERIFIER_atomic_CAS_~v#1.offset := __VERIFIER_atomic_CAS_#in~v#1.base, __VERIFIER_atomic_CAS_#in~v#1.offset; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L726: havoc PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L726-1: SUMMARY for call ULTIMATE.dealloc(PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset); srcloc: null [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume false; [2025-02-08 05:10:09,780 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume !false; [2025-02-08 05:10:09,781 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-3: assume false; [2025-02-08 05:10:09,795 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:10:09,796 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:10:09,864 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:10:09,864 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:10:09,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:09 BoogieIcfgContainer [2025-02-08 05:10:09,865 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:10:09,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:10:09,866 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:10:09,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:10:09,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:10:08" (1/3) ... [2025-02-08 05:10:09,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0b33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:09, skipping insertion in model container [2025-02-08 05:10:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:09" (2/3) ... [2025-02-08 05:10:09,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0b33ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:09, skipping insertion in model container [2025-02-08 05:10:09,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:09" (3/3) ... [2025-02-08 05:10:09,873 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas-race.i [2025-02-08 05:10:09,884 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:10:09,886 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas-race.i that has 2 procedures, 122 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-02-08 05:10:09,886 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:10:09,943 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:09,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 127 transitions, 258 flow [2025-02-08 05:10:10,016 INFO L124 PetriNetUnfolderBase]: 5/134 cut-off events. [2025-02-08 05:10:10,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:10,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 134 events. 5/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 233 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 111. Up to 3 conditions per place. [2025-02-08 05:10:10,025 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 127 transitions, 258 flow [2025-02-08 05:10:10,029 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 127 transitions, 258 flow [2025-02-08 05:10:10,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:10,048 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;@7ac2d01f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:10,048 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:10:10,055 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:10,055 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:10:10,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:10,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,056 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] [2025-02-08 05:10:10,056 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:10:10,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1861320269, now seen corresponding path program 1 times [2025-02-08 05:10:10,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995540685] [2025-02-08 05:10:10,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:10,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:10,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:10,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:10,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:10,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995540685] [2025-02-08 05:10:10,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995540685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:10,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:10,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:10,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802199209] [2025-02-08 05:10:10,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:10,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:10,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:10,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:10,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 127 [2025-02-08 05:10:10,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 258 flow. Second operand has 2 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:10,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 127 [2025-02-08 05:10:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:10,254 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2025-02-08 05:10:10,254 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:10,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118 conditions, 109 events. 2/109 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 128 event pairs, 0 based on Foata normal form. 9/109 useless extension candidates. Maximal degree in co-relation 93. Up to 5 conditions per place. [2025-02-08 05:10:10,255 INFO L140 encePairwiseOnDemand]: 115/127 looper letters, 4 selfloop transitions, 0 changer transitions 0/106 dead transitions. [2025-02-08 05:10:10,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 106 transitions, 224 flow [2025-02-08 05:10:10,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:10,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 236 transitions. [2025-02-08 05:10:10,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9291338582677166 [2025-02-08 05:10:10,285 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 258 flow. Second operand 2 states and 236 transitions. [2025-02-08 05:10:10,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 106 transitions, 224 flow [2025-02-08 05:10:10,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 224 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:10,292 INFO L231 Difference]: Finished difference. Result has 108 places, 106 transitions, 216 flow [2025-02-08 05:10:10,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=216, PETRI_PLACES=108, PETRI_TRANSITIONS=106} [2025-02-08 05:10:10,297 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -17 predicate places. [2025-02-08 05:10:10,298 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 106 transitions, 216 flow [2025-02-08 05:10:10,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.0) internal successors, (222), 2 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,298 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,298 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] [2025-02-08 05:10:10,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:10:10,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:10:10,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2022366697, now seen corresponding path program 1 times [2025-02-08 05:10:10,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549769916] [2025-02-08 05:10:10,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:10,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:10,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:10,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:10,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549769916] [2025-02-08 05:10:10,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549769916] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:10,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:10,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819800929] [2025-02-08 05:10:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:10,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:10,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 127 [2025-02-08 05:10:10,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 106 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:10,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 127 [2025-02-08 05:10:10,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:10,387 INFO L124 PetriNetUnfolderBase]: 2/108 cut-off events. [2025-02-08 05:10:10,388 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:10,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 124 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 117. Up to 5 conditions per place. [2025-02-08 05:10:10,389 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 5 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-02-08 05:10:10,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 228 flow [2025-02-08 05:10:10,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:10,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:10,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2025-02-08 05:10:10,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8556430446194225 [2025-02-08 05:10:10,393 INFO L175 Difference]: Start difference. First operand has 108 places, 106 transitions, 216 flow. Second operand 3 states and 326 transitions. [2025-02-08 05:10:10,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 228 flow [2025-02-08 05:10:10,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:10,397 INFO L231 Difference]: Finished difference. Result has 109 places, 105 transitions, 218 flow [2025-02-08 05:10:10,398 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=109, PETRI_TRANSITIONS=105} [2025-02-08 05:10:10,398 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -16 predicate places. [2025-02-08 05:10:10,398 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 105 transitions, 218 flow [2025-02-08 05:10:10,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,399 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:10,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:10:10,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-02-08 05:10:10,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1218961090, now seen corresponding path program 1 times [2025-02-08 05:10:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472966816] [2025-02-08 05:10:10,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:10:10,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:10:10,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:10,414 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:10,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:10:10,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:10:10,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:10,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:10,431 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:10,432 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-08 05:10:10,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-08 05:10:10,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-08 05:10:10,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-08 05:10:10,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-08 05:10:10,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-08 05:10:10,434 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-08 05:10:10,435 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-08 05:10:10,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:10:10,435 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:10:10,437 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:10,438 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:10:10,478 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:10,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 230 transitions, 470 flow [2025-02-08 05:10:10,520 INFO L124 PetriNetUnfolderBase]: 10/246 cut-off events. [2025-02-08 05:10:10,520 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:10:10,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 246 events. 10/246 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 842 event pairs, 0 based on Foata normal form. 0/205 useless extension candidates. Maximal degree in co-relation 213. Up to 3 conditions per place. [2025-02-08 05:10:10,523 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 230 transitions, 470 flow [2025-02-08 05:10:10,527 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 225 places, 230 transitions, 470 flow [2025-02-08 05:10:10,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:10,529 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;@7ac2d01f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:10,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-08 05:10:10,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:10,532 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:10:10,534 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:10,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:10,534 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:10:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -240861991, now seen corresponding path program 1 times [2025-02-08 05:10:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702215045] [2025-02-08 05:10:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:10,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:10,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702215045] [2025-02-08 05:10:10,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702215045] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:10,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:10,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:10,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458623480] [2025-02-08 05:10:10,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:10,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:10,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:10,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:10,567 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:10,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 230 [2025-02-08 05:10:10,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 230 transitions, 470 flow. Second operand has 2 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:10,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 230 [2025-02-08 05:10:10,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:10,656 INFO L124 PetriNetUnfolderBase]: 24/548 cut-off events. [2025-02-08 05:10:10,656 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:10:10,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 598 conditions, 548 events. 24/548 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2956 event pairs, 12 based on Foata normal form. 57/547 useless extension candidates. Maximal degree in co-relation 460. Up to 33 conditions per place. [2025-02-08 05:10:10,661 INFO L140 encePairwiseOnDemand]: 207/230 looper letters, 8 selfloop transitions, 0 changer transitions 0/192 dead transitions. [2025-02-08 05:10:10,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 192 transitions, 410 flow [2025-02-08 05:10:10,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:10,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 425 transitions. [2025-02-08 05:10:10,665 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239130434782609 [2025-02-08 05:10:10,665 INFO L175 Difference]: Start difference. First operand has 225 places, 230 transitions, 470 flow. Second operand 2 states and 425 transitions. [2025-02-08 05:10:10,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 192 transitions, 410 flow [2025-02-08 05:10:10,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 192 transitions, 410 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:10,670 INFO L231 Difference]: Finished difference. Result has 194 places, 192 transitions, 394 flow [2025-02-08 05:10:10,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=394, PETRI_PLACES=194, PETRI_TRANSITIONS=192} [2025-02-08 05:10:10,671 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -31 predicate places. [2025-02-08 05:10:10,671 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 192 transitions, 394 flow [2025-02-08 05:10:10,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 198.0) internal successors, (396), 2 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,671 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] [2025-02-08 05:10:10,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:10:10,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:10:10,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,672 INFO L85 PathProgramCache]: Analyzing trace with hash 459887933, now seen corresponding path program 1 times [2025-02-08 05:10:10,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710135244] [2025-02-08 05:10:10,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:10,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:10,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:10,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710135244] [2025-02-08 05:10:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710135244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:10,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:10,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:10,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92327175] [2025-02-08 05:10:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:10,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:10,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:10,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:10,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:10,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 230 [2025-02-08 05:10:10,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 194 places, 192 transitions, 394 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:10,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 230 [2025-02-08 05:10:10,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:10,896 INFO L124 PetriNetUnfolderBase]: 75/1093 cut-off events. [2025-02-08 05:10:10,900 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:10:10,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1243 conditions, 1093 events. 75/1093 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 7946 event pairs, 20 based on Foata normal form. 0/983 useless extension candidates. Maximal degree in co-relation 1238. Up to 64 conditions per place. [2025-02-08 05:10:10,911 INFO L140 encePairwiseOnDemand]: 222/230 looper letters, 23 selfloop transitions, 6 changer transitions 0/205 dead transitions. [2025-02-08 05:10:10,911 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 196 places, 205 transitions, 483 flow [2025-02-08 05:10:10,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:10,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:10,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 598 transitions. [2025-02-08 05:10:10,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8666666666666667 [2025-02-08 05:10:10,913 INFO L175 Difference]: Start difference. First operand has 194 places, 192 transitions, 394 flow. Second operand 3 states and 598 transitions. [2025-02-08 05:10:10,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 196 places, 205 transitions, 483 flow [2025-02-08 05:10:10,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 205 transitions, 483 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:10,918 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 446 flow [2025-02-08 05:10:10,918 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=446, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-02-08 05:10:10,919 INFO L279 CegarLoopForPetriNet]: 225 programPoint places, -27 predicate places. [2025-02-08 05:10:10,920 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 446 flow [2025-02-08 05:10:10,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:10,920 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:10,920 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:10,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:10:10,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-02-08 05:10:10,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:10,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1019142682, now seen corresponding path program 1 times [2025-02-08 05:10:10,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:10,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61003193] [2025-02-08 05:10:10,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:10,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:10,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:10,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:10,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:10,942 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:10,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:10,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:10,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:10,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:10,959 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:10,961 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2025-02-08 05:10:10,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (12 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2025-02-08 05:10:10,963 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2025-02-08 05:10:10,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:10:10,963 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:10:10,963 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:10,963 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:10:11,025 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:11,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 333 transitions, 684 flow [2025-02-08 05:10:11,081 INFO L124 PetriNetUnfolderBase]: 15/358 cut-off events. [2025-02-08 05:10:11,082 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:10:11,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 358 events. 15/358 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1519 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 315. Up to 4 conditions per place. [2025-02-08 05:10:11,086 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 333 transitions, 684 flow [2025-02-08 05:10:11,090 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 333 transitions, 684 flow [2025-02-08 05:10:11,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:11,093 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;@7ac2d01f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:11,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 05:10:11,095 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:11,096 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:10:11,096 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:11,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:11,097 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] [2025-02-08 05:10:11,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:10:11,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:11,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1246237695, now seen corresponding path program 1 times [2025-02-08 05:10:11,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59397319] [2025-02-08 05:10:11,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:11,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:11,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:11,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:11,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:11,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59397319] [2025-02-08 05:10:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59397319] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120871010] [2025-02-08 05:10:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:11,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:11,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:11,121 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 284 out of 333 [2025-02-08 05:10:11,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 333 transitions, 684 flow. Second operand has 2 states, 2 states have (on average 285.0) internal successors, (570), 2 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:11,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:11,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 284 of 333 [2025-02-08 05:10:11,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:11,375 INFO L124 PetriNetUnfolderBase]: 162/2415 cut-off events. [2025-02-08 05:10:11,376 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-02-08 05:10:11,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2415 events. 162/2415 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21890 event pairs, 108 based on Foata normal form. 296/2438 useless extension candidates. Maximal degree in co-relation 1997. Up to 193 conditions per place. [2025-02-08 05:10:11,403 INFO L140 encePairwiseOnDemand]: 299/333 looper letters, 12 selfloop transitions, 0 changer transitions 0/278 dead transitions. [2025-02-08 05:10:11,403 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 278 transitions, 598 flow [2025-02-08 05:10:11,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:11,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 614 transitions. [2025-02-08 05:10:11,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9219219219219219 [2025-02-08 05:10:11,407 INFO L175 Difference]: Start difference. First operand has 325 places, 333 transitions, 684 flow. Second operand 2 states and 614 transitions. [2025-02-08 05:10:11,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 278 transitions, 598 flow [2025-02-08 05:10:11,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 278 transitions, 596 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:11,410 INFO L231 Difference]: Finished difference. Result has 280 places, 278 transitions, 572 flow [2025-02-08 05:10:11,411 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=572, PETRI_PLACES=280, PETRI_TRANSITIONS=278} [2025-02-08 05:10:11,412 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -45 predicate places. [2025-02-08 05:10:11,412 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 278 transitions, 572 flow [2025-02-08 05:10:11,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 285.0) internal successors, (570), 2 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:11,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:11,413 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] [2025-02-08 05:10:11,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:10:11,414 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:10:11,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:11,414 INFO L85 PathProgramCache]: Analyzing trace with hash -661412733, now seen corresponding path program 1 times [2025-02-08 05:10:11,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:11,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789881604] [2025-02-08 05:10:11,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:11,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:11,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:11,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:11,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:11,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:11,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:11,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:11,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789881604] [2025-02-08 05:10:11,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789881604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:11,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:11,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:11,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936147976] [2025-02-08 05:10:11,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:11,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:11,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:11,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:11,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:11,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 272 out of 333 [2025-02-08 05:10:11,481 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 278 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:11,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:11,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 272 of 333 [2025-02-08 05:10:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:12,359 INFO L124 PetriNetUnfolderBase]: 1225/10396 cut-off events. [2025-02-08 05:10:12,360 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2025-02-08 05:10:12,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12319 conditions, 10396 events. 1225/10396 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 129812 event pairs, 367 based on Foata normal form. 0/9329 useless extension candidates. Maximal degree in co-relation 12313. Up to 910 conditions per place. [2025-02-08 05:10:12,436 INFO L140 encePairwiseOnDemand]: 321/333 looper letters, 35 selfloop transitions, 9 changer transitions 0/298 dead transitions. [2025-02-08 05:10:12,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 298 transitions, 710 flow [2025-02-08 05:10:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 863 transitions. [2025-02-08 05:10:12,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8638638638638638 [2025-02-08 05:10:12,438 INFO L175 Difference]: Start difference. First operand has 280 places, 278 transitions, 572 flow. Second operand 3 states and 863 transitions. [2025-02-08 05:10:12,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 298 transitions, 710 flow [2025-02-08 05:10:12,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 298 transitions, 710 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:12,443 INFO L231 Difference]: Finished difference. Result has 284 places, 287 transitions, 650 flow [2025-02-08 05:10:12,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=284, PETRI_TRANSITIONS=287} [2025-02-08 05:10:12,443 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -41 predicate places. [2025-02-08 05:10:12,443 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 287 transitions, 650 flow [2025-02-08 05:10:12,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.3333333333333) internal successors, (820), 3 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:12,444 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:12,444 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] [2025-02-08 05:10:12,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:10:12,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:10:12,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash 65653939, now seen corresponding path program 1 times [2025-02-08 05:10:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:12,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617022927] [2025-02-08 05:10:12,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:12,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:12,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:12,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:12,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:12,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:12,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:12,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617022927] [2025-02-08 05:10:12,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617022927] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:12,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:12,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:12,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844368590] [2025-02-08 05:10:12,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:12,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:12,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:12,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:12,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:13,016 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 333 [2025-02-08 05:10:13,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 287 transitions, 650 flow. Second operand has 6 states, 6 states have (on average 234.66666666666666) internal successors, (1408), 6 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:13,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:13,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 333 [2025-02-08 05:10:13,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:23,260 INFO L124 PetriNetUnfolderBase]: 52503/137593 cut-off events. [2025-02-08 05:10:23,260 INFO L125 PetriNetUnfolderBase]: For 3553/3558 co-relation queries the response was YES. [2025-02-08 05:10:23,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219546 conditions, 137593 events. 52503/137593 cut-off events. For 3553/3558 co-relation queries the response was YES. Maximal size of possible extension queue 3715. Compared 1908109 event pairs, 28618 based on Foata normal form. 0/127035 useless extension candidates. Maximal degree in co-relation 219538. Up to 55296 conditions per place. [2025-02-08 05:10:24,421 INFO L140 encePairwiseOnDemand]: 296/333 looper letters, 148 selfloop transitions, 90 changer transitions 0/462 dead transitions. [2025-02-08 05:10:24,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 462 transitions, 1516 flow [2025-02-08 05:10:24,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1637 transitions. [2025-02-08 05:10:24,425 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8193193193193193 [2025-02-08 05:10:24,425 INFO L175 Difference]: Start difference. First operand has 284 places, 287 transitions, 650 flow. Second operand 6 states and 1637 transitions. [2025-02-08 05:10:24,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 462 transitions, 1516 flow [2025-02-08 05:10:24,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 462 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:10:24,440 INFO L231 Difference]: Finished difference. Result has 291 places, 388 transitions, 1272 flow [2025-02-08 05:10:24,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1272, PETRI_PLACES=291, PETRI_TRANSITIONS=388} [2025-02-08 05:10:24,440 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -34 predicate places. [2025-02-08 05:10:24,440 INFO L471 AbstractCegarLoop]: Abstraction has has 291 places, 388 transitions, 1272 flow [2025-02-08 05:10:24,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 234.66666666666666) internal successors, (1408), 6 states have internal predecessors, (1408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:24,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:24,441 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:10:24,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:10:24,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 41 more)] === [2025-02-08 05:10:24,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:24,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1236816681, now seen corresponding path program 1 times [2025-02-08 05:10:24,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:24,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478638630] [2025-02-08 05:10:24,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:24,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:24,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:10:24,452 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:10:24,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:24,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:24,453 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:24,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:10:24,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:10:24,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:24,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:24,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:24,466 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-02-08 05:10:24,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-02-08 05:10:24,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-02-08 05:10:24,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-02-08 05:10:24,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-02-08 05:10:24,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:10:24,469 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:10:24,469 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:24,469 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:10:24,527 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:24,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 425 places, 436 transitions, 900 flow [2025-02-08 05:10:24,568 INFO L124 PetriNetUnfolderBase]: 20/470 cut-off events. [2025-02-08 05:10:24,568 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:10:24,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 489 conditions, 470 events. 20/470 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2307 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 417. Up to 5 conditions per place. [2025-02-08 05:10:24,575 INFO L82 GeneralOperation]: Start removeDead. Operand has 425 places, 436 transitions, 900 flow [2025-02-08 05:10:24,578 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 425 places, 436 transitions, 900 flow [2025-02-08 05:10:24,578 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:24,579 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;@7ac2d01f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:24,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-08 05:10:24,580 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:24,580 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:10:24,580 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:24,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:24,580 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] [2025-02-08 05:10:24,580 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err15ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:10:24,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:24,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1694981979, now seen corresponding path program 1 times [2025-02-08 05:10:24,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:24,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418602081] [2025-02-08 05:10:24,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:24,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:24,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:24,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:24,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:24,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:24,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:24,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418602081] [2025-02-08 05:10:24,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418602081] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:24,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:24,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:24,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486973990] [2025-02-08 05:10:24,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:24,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:24,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:24,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:24,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:24,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 436 [2025-02-08 05:10:24,596 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 436 transitions, 900 flow. Second operand has 2 states, 2 states have (on average 372.0) internal successors, (744), 2 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:24,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:24,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 436 [2025-02-08 05:10:24,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:25,530 INFO L124 PetriNetUnfolderBase]: 908/10138 cut-off events. [2025-02-08 05:10:25,530 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2025-02-08 05:10:25,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11566 conditions, 10138 events. 908/10138 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 281. Compared 126145 event pairs, 684 based on Foata normal form. 1502/10472 useless extension candidates. Maximal degree in co-relation 8430. Up to 1025 conditions per place. [2025-02-08 05:10:25,668 INFO L140 encePairwiseOnDemand]: 391/436 looper letters, 16 selfloop transitions, 0 changer transitions 0/364 dead transitions. [2025-02-08 05:10:25,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 364 transitions, 788 flow [2025-02-08 05:10:25,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:25,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:25,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 803 transitions. [2025-02-08 05:10:25,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9208715596330275 [2025-02-08 05:10:25,670 INFO L175 Difference]: Start difference. First operand has 425 places, 436 transitions, 900 flow. Second operand 2 states and 803 transitions. [2025-02-08 05:10:25,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 364 transitions, 788 flow [2025-02-08 05:10:25,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 364 transitions, 782 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:25,673 INFO L231 Difference]: Finished difference. Result has 366 places, 364 transitions, 750 flow [2025-02-08 05:10:25,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=750, PETRI_PLACES=366, PETRI_TRANSITIONS=364} [2025-02-08 05:10:25,674 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -59 predicate places. [2025-02-08 05:10:25,674 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 364 transitions, 750 flow [2025-02-08 05:10:25,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 372.0) internal successors, (744), 2 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:25,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:25,675 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] [2025-02-08 05:10:25,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:10:25,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err13ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:10:25,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:25,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1085021463, now seen corresponding path program 1 times [2025-02-08 05:10:25,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:25,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100950141] [2025-02-08 05:10:25,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:25,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:25,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:25,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:25,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:25,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:25,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:25,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:25,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100950141] [2025-02-08 05:10:25,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100950141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:25,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:25,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:25,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115653953] [2025-02-08 05:10:25,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:25,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:25,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:25,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:25,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:25,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 436 [2025-02-08 05:10:25,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 364 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:25,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:25,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 436 [2025-02-08 05:10:25,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:34,607 INFO L124 PetriNetUnfolderBase]: 16102/96871 cut-off events. [2025-02-08 05:10:34,607 INFO L125 PetriNetUnfolderBase]: For 2206/2206 co-relation queries the response was YES. [2025-02-08 05:10:35,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119607 conditions, 96871 events. 16102/96871 cut-off events. For 2206/2206 co-relation queries the response was YES. Maximal size of possible extension queue 2927. Compared 1653890 event pairs, 5099 based on Foata normal form. 0/87012 useless extension candidates. Maximal degree in co-relation 119600. Up to 11061 conditions per place. [2025-02-08 05:10:36,045 INFO L140 encePairwiseOnDemand]: 420/436 looper letters, 47 selfloop transitions, 12 changer transitions 0/391 dead transitions. [2025-02-08 05:10:36,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 368 places, 391 transitions, 937 flow [2025-02-08 05:10:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:36,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-02-08 05:10:36,047 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8623853211009175 [2025-02-08 05:10:36,047 INFO L175 Difference]: Start difference. First operand has 366 places, 364 transitions, 750 flow. Second operand 3 states and 1128 transitions. [2025-02-08 05:10:36,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 368 places, 391 transitions, 937 flow [2025-02-08 05:10:36,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 391 transitions, 937 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:36,052 INFO L231 Difference]: Finished difference. Result has 370 places, 376 transitions, 854 flow [2025-02-08 05:10:36,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=436, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=364, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=376} [2025-02-08 05:10:36,053 INFO L279 CegarLoopForPetriNet]: 425 programPoint places, -55 predicate places. [2025-02-08 05:10:36,053 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 376 transitions, 854 flow [2025-02-08 05:10:36,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 356.3333333333333) internal successors, (1069), 3 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:36,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:36,053 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] [2025-02-08 05:10:36,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:10:36,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err12ASSERT_VIOLATIONDATA_RACE === [thr1Err15ASSERT_VIOLATIONDATA_RACE, thr1Err14ASSERT_VIOLATIONDATA_RACE, thr1Err13ASSERT_VIOLATIONDATA_RACE, thr1Err7ASSERT_VIOLATIONDATA_RACE (and 52 more)] === [2025-02-08 05:10:36,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash -867564135, now seen corresponding path program 1 times [2025-02-08 05:10:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123622063] [2025-02-08 05:10:36,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:36,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:36,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:36,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:36,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:10:36,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:36,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123622063] [2025-02-08 05:10:36,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123622063] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:36,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:36,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:36,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337571938] [2025-02-08 05:10:36,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:36,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:36,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:36,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:36,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:36,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 305 out of 436 [2025-02-08 05:10:36,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 376 transitions, 854 flow. Second operand has 6 states, 6 states have (on average 306.6666666666667) internal successors, (1840), 6 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:10:36,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:36,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 305 of 436 [2025-02-08 05:10:36,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand