./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-ext/08_rand_cas.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.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 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:10:09,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:10:09,715 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:09,718 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:10:09,718 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:10:09,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:10:09,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:10:09,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:10:09,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:10:09,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:10:09,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:10:09,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:10:09,731 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:10:09,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:10:09,732 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:10:09,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:09,733 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:10:09,733 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:10:09,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:10:09,734 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 -> 111430583c5cad5728291a83d9964586feec908088fcc502d1f1ab24d409725c [2025-02-08 05:10:09,937 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:10:09,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:10:09,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:10:09,948 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:10:09,948 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:10:09,953 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.i [2025-02-08 05:10:11,077 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29a27455d/ffa1d185b2114dcabd8ce2275b01c60f/FLAGae62153b2 [2025-02-08 05:10:11,334 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:10:11,336 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-ext/08_rand_cas.i [2025-02-08 05:10:11,347 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29a27455d/ffa1d185b2114dcabd8ce2275b01c60f/FLAGae62153b2 [2025-02-08 05:10:11,362 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/29a27455d/ffa1d185b2114dcabd8ce2275b01c60f [2025-02-08 05:10:11,364 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:10:11,365 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:10:11,366 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:11,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:10:11,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:10:11,371 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:11" (1/1) ... [2025-02-08 05:10:11,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2217ad44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:11, skipping insertion in model container [2025-02-08 05:10:11,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:10:11" (1/1) ... [2025-02-08 05:10:11,398 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:10:11,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:11,666 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:10:11,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:10:11,742 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:10:11,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:11 WrapperNode [2025-02-08 05:10:11,743 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:10:11,744 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:11,744 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:10:11,744 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:10:11,749 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:11" (1/1) ... [2025-02-08 05:10:11,757 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:11" (1/1) ... [2025-02-08 05:10:11,780 INFO L138 Inliner]: procedures = 178, calls = 38, calls flagged for inlining = 16, calls inlined = 17, statements flattened = 214 [2025-02-08 05:10:11,781 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:10:11,781 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:10:11,781 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:10:11,781 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:10:11,786 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:11" (1/1) ... [2025-02-08 05:10:11,786 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:11" (1/1) ... [2025-02-08 05:10:11,789 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:11" (1/1) ... [2025-02-08 05:10:11,789 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:11" (1/1) ... [2025-02-08 05:10:11,803 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:11" (1/1) ... [2025-02-08 05:10:11,804 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:11" (1/1) ... [2025-02-08 05:10:11,809 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:11" (1/1) ... [2025-02-08 05:10:11,810 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:11" (1/1) ... [2025-02-08 05:10:11,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:10:11,816 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:10:11,816 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:10:11,816 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:10:11,817 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:11" (1/1) ... [2025-02-08 05:10:11,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:10:11,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:10:11,856 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:11,862 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:11,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:10:11,878 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-02-08 05:10:11,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:10:11,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:10:11,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-08 05:10:11,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:10:11,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:10:11,881 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:11,966 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:10:11,967 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733: havoc PseudoRandomUsingAtomic_nextInt_#t~ret11#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-1: PseudoRandomUsingAtomic_nextInt_~nexts~0#1 := PseudoRandomUsingAtomic_nextInt_#t~ret11#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-2: assume { :end_inline_calculateNext } true;assume -2147483648 <= PseudoRandomUsingAtomic_nextInt_#t~ret11#1 && PseudoRandomUsingAtomic_nextInt_#t~ret11#1 <= 2147483647; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-3: havoc calculateNext_#in~s2#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-4: havoc calculateNext_#t~nondet3#1, calculateNext_~s2#1, calculateNext_~calculateNext_return~0#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L733-5: PseudoRandomUsingAtomic_nextInt_#t~ret11#1 := calculateNext_#res#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume __VERIFIER_atomic_CAS_#t~mem6#1 == __VERIFIER_atomic_CAS_~e#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: assume !(__VERIFIER_atomic_CAS_#t~mem6#1 == __VERIFIER_atomic_CAS_~e#1); [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: havoc __VERIFIER_atomic_CAS_#t~mem6#1; [2025-02-08 05:10:12,245 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-2: havoc __VERIFIER_atomic_CAS_#t~mem6#1; [2025-02-08 05:10:12,249 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-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:12,249 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-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:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-4: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,3 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-5: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,2 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-6: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,1 + __VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-7: #race := #race[__VERIFIER_atomic_CAS_~v#1.base,__VERIFIER_atomic_CAS_~v#1.offset := 0]; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-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:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-2: assume !!(PseudoRandomUsingAtomic_nextInt_~nexts~0#1 != PseudoRandomUsingAtomic_nextInt_~read~0#1); [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L734-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:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: [2025-02-08 05:10:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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:12,250 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L735-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:10:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-2: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:10:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-7: havoc __VERIFIER_atomic_CAS_#t~nondet8#1; [2025-02-08 05:10:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,251 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-14: havoc __VERIFIER_atomic_CAS_#t~nondet7#1; [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume 1 == PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: assume !(1 == PseudoRandomUsingAtomic_nextInt_#t~mem12#1); [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L719-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:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: havoc PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-2: havoc PseudoRandomUsingAtomic_nextInt_#t~mem12#1; [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-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:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-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:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-4: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,3 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:12,252 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-5: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,2 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-6: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,1 + PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-7: #race := #race[PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base,PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset := 0]; [2025-02-08 05:10:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-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:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L737: 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:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: 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:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723: 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:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-1: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:10:12,253 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-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:12,256 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-6: havoc __VERIFIER_atomic_CAS_#t~nondet9#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L723-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760: havoc PseudoRandomUsingAtomic__threadmain_#t~ret15#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-1: PseudoRandomUsingAtomic__threadmain_~myrand~0#1 := PseudoRandomUsingAtomic__threadmain_#t~ret15#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-3: havoc PseudoRandomUsingAtomic_nextInt_#in~n#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L760-5: PseudoRandomUsingAtomic__threadmain_#t~ret15#1 := PseudoRandomUsingAtomic_nextInt_#res#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17: assume !false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-1: assume false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-2: assume !false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L17-3: assume false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L777: havoc PseudoRandomUsingAtomic__threadmain_#t~ret15#1, PseudoRandomUsingAtomic__threadmain_~myrand~0#1;assume { :end_inline_PseudoRandomUsingAtomic__threadmain } true; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711: __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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-1: __VERIFIER_atomic_CAS_~u#1 := __VERIFIER_atomic_CAS_#in~u#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-2: __VERIFIER_atomic_CAS_~e#1 := __VERIFIER_atomic_CAS_#in~e#1; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L711-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:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761: assume { :end_inline_reach_error } true;assume false; [2025-02-08 05:10:12,257 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-1: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:10:12,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728: havoc PseudoRandomUsingAtomic_nextInt_~#casret~0#1.base, PseudoRandomUsingAtomic_nextInt_~#casret~0#1.offset; [2025-02-08 05:10:12,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 05:10:12,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-2: assume !!(PseudoRandomUsingAtomic__threadmain_~myrand~0#1 <= 10); [2025-02-08 05:10:12,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L728-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:12,258 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L761-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:12,288 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:10:12,288 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:10:12,374 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:10:12,377 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:10:12,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:12 BoogieIcfgContainer [2025-02-08 05:10:12,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:10:12,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:10:12,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:10:12,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:10:12,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:10:11" (1/3) ... [2025-02-08 05:10:12,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea83b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:12, skipping insertion in model container [2025-02-08 05:10:12,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:10:11" (2/3) ... [2025-02-08 05:10:12,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea83b86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:10:12, skipping insertion in model container [2025-02-08 05:10:12,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:10:12" (3/3) ... [2025-02-08 05:10:12,385 INFO L128 eAbstractionObserver]: Analyzing ICFG 08_rand_cas.i [2025-02-08 05:10:12,395 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:10:12,396 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 08_rand_cas.i that has 2 procedures, 109 locations, 1 initial locations, 4 loop locations, and 16 error locations. [2025-02-08 05:10:12,396 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:10:12,450 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:12,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 114 transitions, 232 flow [2025-02-08 05:10:12,521 INFO L124 PetriNetUnfolderBase]: 5/121 cut-off events. [2025-02-08 05:10:12,522 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:12,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 121 events. 5/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 223 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2025-02-08 05:10:12,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 114 transitions, 232 flow [2025-02-08 05:10:12,530 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 114 transitions, 232 flow [2025-02-08 05:10:12,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:12,547 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;@4206fa98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:12,549 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-02-08 05:10:12,555 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:12,556 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:10:12,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:12,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:12,556 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:12,556 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:12,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:12,565 INFO L85 PathProgramCache]: Analyzing trace with hash -827728293, now seen corresponding path program 1 times [2025-02-08 05:10:12,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:12,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-02-08 05:10:12,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:12,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:12,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:12,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:12,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:12,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:12,723 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,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:12,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623015516] [2025-02-08 05:10:12,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623015516] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:12,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:12,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:12,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765130627] [2025-02-08 05:10:12,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:12,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:12,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:12,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:12,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:12,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 114 [2025-02-08 05:10:12,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 232 flow. Second operand has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:12,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 114 [2025-02-08 05:10:12,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:12,796 INFO L124 PetriNetUnfolderBase]: 2/94 cut-off events. [2025-02-08 05:10:12,797 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:12,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 94 events. 2/94 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 106 event pairs, 0 based on Foata normal form. 11/98 useless extension candidates. Maximal degree in co-relation 80. Up to 7 conditions per place. [2025-02-08 05:10:12,799 INFO L140 encePairwiseOnDemand]: 100/114 looper letters, 6 selfloop transitions, 0 changer transitions 0/91 dead transitions. [2025-02-08 05:10:12,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 198 flow [2025-02-08 05:10:12,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:12,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 206 transitions. [2025-02-08 05:10:12,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-02-08 05:10:12,813 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 232 flow. Second operand 2 states and 206 transitions. [2025-02-08 05:10:12,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 198 flow [2025-02-08 05:10:12,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 91 transitions, 198 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:12,821 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 186 flow [2025-02-08 05:10:12,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=186, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-02-08 05:10:12,826 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -19 predicate places. [2025-02-08 05:10:12,827 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 186 flow [2025-02-08 05:10:12,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 94.0) internal successors, (188), 2 states have internal predecessors, (188), 0 states have call successors, (0), 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,828 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:12,828 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:12,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:10:12,828 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:12,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:12,829 INFO L85 PathProgramCache]: Analyzing trace with hash -877922753, now seen corresponding path program 1 times [2025-02-08 05:10:12,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:12,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273849906] [2025-02-08 05:10:12,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:12,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:12,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:12,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:12,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:12,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:12,904 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,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273849906] [2025-02-08 05:10:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273849906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:12,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:12,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:12,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279901324] [2025-02-08 05:10:12,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:12,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:12,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:12,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:12,917 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 114 [2025-02-08 05:10:12,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:12,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 114 [2025-02-08 05:10:12,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:12,953 INFO L124 PetriNetUnfolderBase]: 2/93 cut-off events. [2025-02-08 05:10:12,953 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:10:12,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108 conditions, 93 events. 2/93 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 104. Up to 6 conditions per place. [2025-02-08 05:10:12,953 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 7 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-02-08 05:10:12,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 90 transitions, 202 flow [2025-02-08 05:10:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:12,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2025-02-08 05:10:12,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8099415204678363 [2025-02-08 05:10:12,958 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 186 flow. Second operand 3 states and 277 transitions. [2025-02-08 05:10:12,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 90 transitions, 202 flow [2025-02-08 05:10:12,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 202 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:12,960 INFO L231 Difference]: Finished difference. Result has 94 places, 90 transitions, 188 flow [2025-02-08 05:10:12,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=94, PETRI_TRANSITIONS=90} [2025-02-08 05:10:12,962 INFO L279 CegarLoopForPetriNet]: 112 programPoint places, -18 predicate places. [2025-02-08 05:10:12,962 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 90 transitions, 188 flow [2025-02-08 05:10:12,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:12,963 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:12,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:10:12,963 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:12,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:12,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1073252501, now seen corresponding path program 1 times [2025-02-08 05:10:12,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:12,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763566007] [2025-02-08 05:10:12,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:12,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:12,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:10:13,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:10:13,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:13,003 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:13,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:10:13,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:10:13,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:13,022 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:13,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:13,025 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-02-08 05:10:13,027 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-02-08 05:10:13,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-02-08 05:10:13,030 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-02-08 05:10:13,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:10:13,030 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:10:13,033 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:13,033 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:10:13,082 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:13,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 204 transitions, 418 flow [2025-02-08 05:10:13,127 INFO L124 PetriNetUnfolderBase]: 10/220 cut-off events. [2025-02-08 05:10:13,127 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:10:13,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 228 conditions, 220 events. 10/220 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 743 event pairs, 0 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 187. Up to 3 conditions per place. [2025-02-08 05:10:13,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 204 transitions, 418 flow [2025-02-08 05:10:13,132 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 199 places, 204 transitions, 418 flow [2025-02-08 05:10:13,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:13,135 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;@4206fa98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:13,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 34 error locations. [2025-02-08 05:10:13,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:13,141 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-02-08 05:10:13,141 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:13,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:13,141 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:13,141 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:13,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:13,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1967434092, now seen corresponding path program 1 times [2025-02-08 05:10:13,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:13,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-02-08 05:10:13,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:13,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:13,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:13,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:13,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:13,170 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:13,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:13,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314631517] [2025-02-08 05:10:13,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314631517] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:13,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:13,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:13,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049930952] [2025-02-08 05:10:13,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:13,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:13,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:13,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:13,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:13,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 204 [2025-02-08 05:10:13,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 204 transitions, 418 flow. Second operand has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 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,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:13,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 204 [2025-02-08 05:10:13,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:13,257 INFO L124 PetriNetUnfolderBase]: 46/614 cut-off events. [2025-02-08 05:10:13,257 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-02-08 05:10:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 710 conditions, 614 events. 46/614 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3640 event pairs, 30 based on Foata normal form. 101/651 useless extension candidates. Maximal degree in co-relation 575. Up to 73 conditions per place. [2025-02-08 05:10:13,261 INFO L140 encePairwiseOnDemand]: 177/204 looper letters, 12 selfloop transitions, 0 changer transitions 0/162 dead transitions. [2025-02-08 05:10:13,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 162 transitions, 358 flow [2025-02-08 05:10:13,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:13,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 365 transitions. [2025-02-08 05:10:13,263 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946078431372549 [2025-02-08 05:10:13,263 INFO L175 Difference]: Start difference. First operand has 199 places, 204 transitions, 418 flow. Second operand 2 states and 365 transitions. [2025-02-08 05:10:13,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 162 transitions, 358 flow [2025-02-08 05:10:13,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 162 transitions, 358 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:13,265 INFO L231 Difference]: Finished difference. Result has 164 places, 162 transitions, 334 flow [2025-02-08 05:10:13,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=334, PETRI_PLACES=164, PETRI_TRANSITIONS=162} [2025-02-08 05:10:13,266 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, -35 predicate places. [2025-02-08 05:10:13,266 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 162 transitions, 334 flow [2025-02-08 05:10:13,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 164.0) internal successors, (328), 2 states have internal predecessors, (328), 0 states have call successors, (0), 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,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:13,266 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:13,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:10:13,266 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:13,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:13,267 INFO L85 PathProgramCache]: Analyzing trace with hash -918525736, now seen corresponding path program 1 times [2025-02-08 05:10:13,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:13,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-02-08 05:10:13,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:13,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:13,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:13,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:13,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:13,292 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:13,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:13,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765906176] [2025-02-08 05:10:13,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765906176] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:13,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:13,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:13,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445842457] [2025-02-08 05:10:13,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:13,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:13,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:13,293 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:13,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 204 [2025-02-08 05:10:13,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 162 transitions, 334 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:13,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 204 [2025-02-08 05:10:13,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:13,447 INFO L124 PetriNetUnfolderBase]: 122/1149 cut-off events. [2025-02-08 05:10:13,450 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-02-08 05:10:13,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 1149 events. 122/1149 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 8595 event pairs, 35 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1390. Up to 110 conditions per place. [2025-02-08 05:10:13,454 INFO L140 encePairwiseOnDemand]: 196/204 looper letters, 31 selfloop transitions, 6 changer transitions 0/179 dead transitions. [2025-02-08 05:10:13,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 179 transitions, 447 flow [2025-02-08 05:10:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:13,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2025-02-08 05:10:13,456 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8235294117647058 [2025-02-08 05:10:13,456 INFO L175 Difference]: Start difference. First operand has 164 places, 162 transitions, 334 flow. Second operand 3 states and 504 transitions. [2025-02-08 05:10:13,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 179 transitions, 447 flow [2025-02-08 05:10:13,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 179 transitions, 447 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:13,459 INFO L231 Difference]: Finished difference. Result has 168 places, 168 transitions, 386 flow [2025-02-08 05:10:13,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=204, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=168, PETRI_TRANSITIONS=168} [2025-02-08 05:10:13,463 INFO L279 CegarLoopForPetriNet]: 199 programPoint places, -31 predicate places. [2025-02-08 05:10:13,463 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 168 transitions, 386 flow [2025-02-08 05:10:13,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 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,463 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:13,463 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:13,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:10:13,463 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:13,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:13,464 INFO L85 PathProgramCache]: Analyzing trace with hash -455817091, now seen corresponding path program 1 times [2025-02-08 05:10:13,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:13,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006608503] [2025-02-08 05:10:13,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:13,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:13,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:13,479 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:13,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 05:10:13,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 05:10:13,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:13,493 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:13,493 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (32 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (31 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (30 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (29 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (24 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 34 remaining) [2025-02-08 05:10:13,493 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (22 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (13 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (3 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (2 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 34 remaining) [2025-02-08 05:10:13,494 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 34 remaining) [2025-02-08 05:10:13,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:10:13,494 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-02-08 05:10:13,495 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:13,495 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:10:13,548 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:13,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 294 transitions, 606 flow [2025-02-08 05:10:13,582 INFO L124 PetriNetUnfolderBase]: 15/319 cut-off events. [2025-02-08 05:10:13,582 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-02-08 05:10:13,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 332 conditions, 319 events. 15/319 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1372 event pairs, 0 based on Foata normal form. 0/258 useless extension candidates. Maximal degree in co-relation 276. Up to 4 conditions per place. [2025-02-08 05:10:13,585 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 294 transitions, 606 flow [2025-02-08 05:10:13,588 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 294 transitions, 606 flow [2025-02-08 05:10:13,588 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:13,588 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;@4206fa98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:13,588 INFO L334 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2025-02-08 05:10:13,590 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:13,590 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:10:13,590 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:13,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:13,590 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:13,593 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:13,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:13,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1821877293, now seen corresponding path program 1 times [2025-02-08 05:10:13,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:13,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367949236] [2025-02-08 05:10:13,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:13,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:13,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:13,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:13,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:13,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:13,616 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:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367949236] [2025-02-08 05:10:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367949236] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001183320] [2025-02-08 05:10:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:13,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:13,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:13,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 294 [2025-02-08 05:10:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 294 transitions, 606 flow. Second operand has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 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,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 294 [2025-02-08 05:10:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:14,027 INFO L124 PetriNetUnfolderBase]: 492/3948 cut-off events. [2025-02-08 05:10:14,028 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-02-08 05:10:14,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 3948 events. 492/3948 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 40301 event pairs, 390 based on Foata normal form. 814/4336 useless extension candidates. Maximal degree in co-relation 3840. Up to 649 conditions per place. [2025-02-08 05:10:14,050 INFO L140 encePairwiseOnDemand]: 254/294 looper letters, 18 selfloop transitions, 0 changer transitions 0/233 dead transitions. [2025-02-08 05:10:14,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 233 transitions, 520 flow [2025-02-08 05:10:14,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 524 transitions. [2025-02-08 05:10:14,052 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.891156462585034 [2025-02-08 05:10:14,052 INFO L175 Difference]: Start difference. First operand has 286 places, 294 transitions, 606 flow. Second operand 2 states and 524 transitions. [2025-02-08 05:10:14,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 233 transitions, 520 flow [2025-02-08 05:10:14,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 233 transitions, 518 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:14,055 INFO L231 Difference]: Finished difference. Result has 235 places, 233 transitions, 482 flow [2025-02-08 05:10:14,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=482, PETRI_PLACES=235, PETRI_TRANSITIONS=233} [2025-02-08 05:10:14,055 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -51 predicate places. [2025-02-08 05:10:14,056 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 233 transitions, 482 flow [2025-02-08 05:10:14,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 234.0) internal successors, (468), 2 states have internal predecessors, (468), 0 states have call successors, (0), 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:14,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:14,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, 1, 1] [2025-02-08 05:10:14,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:10:14,056 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:14,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:14,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1522542351, now seen corresponding path program 1 times [2025-02-08 05:10:14,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:14,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569278284] [2025-02-08 05:10:14,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:14,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:14,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:14,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:14,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:14,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:14,078 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:14,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:14,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569278284] [2025-02-08 05:10:14,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569278284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:14,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:14,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:14,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615177552] [2025-02-08 05:10:14,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:14,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:14,083 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:14,083 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:14,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 221 out of 294 [2025-02-08 05:10:14,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 233 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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:14,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:14,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 221 of 294 [2025-02-08 05:10:14,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:15,303 INFO L124 PetriNetUnfolderBase]: 2682/14795 cut-off events. [2025-02-08 05:10:15,304 INFO L125 PetriNetUnfolderBase]: For 364/364 co-relation queries the response was YES. [2025-02-08 05:10:15,347 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18945 conditions, 14795 events. 2682/14795 cut-off events. For 364/364 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 190498 event pairs, 927 based on Foata normal form. 0/13287 useless extension candidates. Maximal degree in co-relation 18939. Up to 1987 conditions per place. [2025-02-08 05:10:15,391 INFO L140 encePairwiseOnDemand]: 282/294 looper letters, 47 selfloop transitions, 9 changer transitions 0/259 dead transitions. [2025-02-08 05:10:15,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 259 transitions, 656 flow [2025-02-08 05:10:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:15,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-02-08 05:10:15,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.81859410430839 [2025-02-08 05:10:15,395 INFO L175 Difference]: Start difference. First operand has 235 places, 233 transitions, 482 flow. Second operand 3 states and 722 transitions. [2025-02-08 05:10:15,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 259 transitions, 656 flow [2025-02-08 05:10:15,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 259 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:15,398 INFO L231 Difference]: Finished difference. Result has 239 places, 242 transitions, 560 flow [2025-02-08 05:10:15,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=239, PETRI_TRANSITIONS=242} [2025-02-08 05:10:15,399 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -47 predicate places. [2025-02-08 05:10:15,399 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 242 transitions, 560 flow [2025-02-08 05:10:15,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 222.33333333333334) internal successors, (667), 3 states have internal predecessors, (667), 0 states have call successors, (0), 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:15,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:15,400 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:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:10:15,400 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:15,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -720074079, now seen corresponding path program 1 times [2025-02-08 05:10:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842376807] [2025-02-08 05:10:15,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:15,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:15,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:15,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:15,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:15,713 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:15,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:15,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842376807] [2025-02-08 05:10:15,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842376807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:15,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:15,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:15,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725690833] [2025-02-08 05:10:15,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:15,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:15,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:15,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:15,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:15,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 294 [2025-02-08 05:10:15,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 242 transitions, 560 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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:15,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:15,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 294 [2025-02-08 05:10:15,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:18,562 INFO L124 PetriNetUnfolderBase]: 11617/35519 cut-off events. [2025-02-08 05:10:18,562 INFO L125 PetriNetUnfolderBase]: For 1651/1656 co-relation queries the response was YES. [2025-02-08 05:10:18,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55102 conditions, 35519 events. 11617/35519 cut-off events. For 1651/1656 co-relation queries the response was YES. Maximal size of possible extension queue 1297. Compared 459813 event pairs, 5548 based on Foata normal form. 0/31780 useless extension candidates. Maximal degree in co-relation 55094. Up to 11635 conditions per place. [2025-02-08 05:10:18,914 INFO L140 encePairwiseOnDemand]: 273/294 looper letters, 96 selfloop transitions, 54 changer transitions 0/353 dead transitions. [2025-02-08 05:10:18,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 353 transitions, 1122 flow [2025-02-08 05:10:18,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:10:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:10:18,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1423 transitions. [2025-02-08 05:10:18,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8066893424036281 [2025-02-08 05:10:18,917 INFO L175 Difference]: Start difference. First operand has 239 places, 242 transitions, 560 flow. Second operand 6 states and 1423 transitions. [2025-02-08 05:10:18,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 353 transitions, 1122 flow [2025-02-08 05:10:18,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 353 transitions, 1104 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:10:18,930 INFO L231 Difference]: Finished difference. Result has 246 places, 299 transitions, 894 flow [2025-02-08 05:10:18,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=246, PETRI_TRANSITIONS=299} [2025-02-08 05:10:18,930 INFO L279 CegarLoopForPetriNet]: 286 programPoint places, -40 predicate places. [2025-02-08 05:10:18,931 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 299 transitions, 894 flow [2025-02-08 05:10:18,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 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:18,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:18,931 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:18,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:10:18,932 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:18,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:18,932 INFO L85 PathProgramCache]: Analyzing trace with hash 704816536, now seen corresponding path program 1 times [2025-02-08 05:10:18,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:18,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226967640] [2025-02-08 05:10:18,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:18,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:10:18,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:10:18,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:18,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:18,945 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:10:18,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-08 05:10:18,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:10:18,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:18,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:10:18,958 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:10:18,958 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:10:18,958 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (43 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (42 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (41 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (40 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (39 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (38 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (37 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (36 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (35 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (34 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (33 of 45 remaining) [2025-02-08 05:10:18,959 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (32 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (31 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (30 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (29 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (28 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (27 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (26 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (25 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (24 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (22 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (21 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (20 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (19 of 45 remaining) [2025-02-08 05:10:18,960 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (18 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (17 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (16 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (15 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (14 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (13 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (12 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (11 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15ASSERT_VIOLATIONDATA_RACE (10 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14ASSERT_VIOLATIONDATA_RACE (9 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13ASSERT_VIOLATIONDATA_RACE (8 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (7 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12ASSERT_VIOLATIONDATA_RACE (5 of 45 remaining) [2025-02-08 05:10:18,961 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (4 of 45 remaining) [2025-02-08 05:10:18,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11ASSERT_VIOLATIONDATA_RACE (3 of 45 remaining) [2025-02-08 05:10:18,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10ASSERT_VIOLATIONDATA_RACE (2 of 45 remaining) [2025-02-08 05:10:18,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (1 of 45 remaining) [2025-02-08 05:10:18,962 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (0 of 45 remaining) [2025-02-08 05:10:18,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:10:18,962 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-02-08 05:10:18,962 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:10:18,962 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-02-08 05:10:19,013 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:10:19,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 373 places, 384 transitions, 796 flow [2025-02-08 05:10:19,067 INFO L124 PetriNetUnfolderBase]: 20/418 cut-off events. [2025-02-08 05:10:19,067 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-08 05:10:19,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 418 events. 20/418 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1994 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 365. Up to 5 conditions per place. [2025-02-08 05:10:19,072 INFO L82 GeneralOperation]: Start removeDead. Operand has 373 places, 384 transitions, 796 flow [2025-02-08 05:10:19,075 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 373 places, 384 transitions, 796 flow [2025-02-08 05:10:19,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:10:19,076 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;@4206fa98, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:10:19,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2025-02-08 05:10:19,078 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:10:19,078 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:10:19,078 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:10:19,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:19,078 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:19,078 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:19,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:19,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1950276966, now seen corresponding path program 1 times [2025-02-08 05:10:19,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:19,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-02-08 05:10:19,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:19,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:19,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-08 05:10:19,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-08 05:10:19,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:19,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:19,089 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:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:19,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779146364] [2025-02-08 05:10:19,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779146364] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:19,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:19,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:10:19,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270053343] [2025-02-08 05:10:19,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:19,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:10:19,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:19,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:10:19,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:10:19,093 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 384 [2025-02-08 05:10:19,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 384 transitions, 796 flow. Second operand has 2 states, 2 states have (on average 304.0) internal successors, (608), 2 states have internal predecessors, (608), 0 states have call successors, (0), 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:19,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:19,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 384 [2025-02-08 05:10:19,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:21,744 INFO L124 PetriNetUnfolderBase]: 4250/25066 cut-off events. [2025-02-08 05:10:21,744 INFO L125 PetriNetUnfolderBase]: For 2401/2401 co-relation queries the response was YES. [2025-02-08 05:10:21,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31500 conditions, 25066 events. 4250/25066 cut-off events. For 2401/2401 co-relation queries the response was YES. Maximal size of possible extension queue 701. Compared 354011 event pairs, 3630 based on Foata normal form. 6155/28586 useless extension candidates. Maximal degree in co-relation 25225. Up to 5185 conditions per place. [2025-02-08 05:10:21,924 INFO L140 encePairwiseOnDemand]: 331/384 looper letters, 24 selfloop transitions, 0 changer transitions 0/304 dead transitions. [2025-02-08 05:10:21,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 304 transitions, 684 flow [2025-02-08 05:10:21,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:10:21,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-02-08 05:10:21,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 683 transitions. [2025-02-08 05:10:21,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8893229166666666 [2025-02-08 05:10:21,927 INFO L175 Difference]: Start difference. First operand has 373 places, 384 transitions, 796 flow. Second operand 2 states and 683 transitions. [2025-02-08 05:10:21,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 304 transitions, 684 flow [2025-02-08 05:10:21,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 304 transitions, 678 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:21,930 INFO L231 Difference]: Finished difference. Result has 306 places, 304 transitions, 630 flow [2025-02-08 05:10:21,930 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=630, PETRI_PLACES=306, PETRI_TRANSITIONS=304} [2025-02-08 05:10:21,931 INFO L279 CegarLoopForPetriNet]: 373 programPoint places, -67 predicate places. [2025-02-08 05:10:21,931 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 304 transitions, 630 flow [2025-02-08 05:10:21,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 304.0) internal successors, (608), 2 states have internal predecessors, (608), 0 states have call successors, (0), 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:21,931 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:21,931 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:21,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:10:21,932 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:21,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:21,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1610474250, now seen corresponding path program 1 times [2025-02-08 05:10:21,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:21,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643185630] [2025-02-08 05:10:21,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:21,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:21,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-08 05:10:21,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-08 05:10:21,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:21,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:21,947 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:21,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:21,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643185630] [2025-02-08 05:10:21,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643185630] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:21,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:21,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:10:21,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101426911] [2025-02-08 05:10:21,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:21,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:10:21,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:21,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:10:21,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:10:21,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 384 [2025-02-08 05:10:21,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 304 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 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:21,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:21,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 384 [2025-02-08 05:10:21,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:10:38,265 INFO L124 PetriNetUnfolderBase]: 44367/180357 cut-off events. [2025-02-08 05:10:38,266 INFO L125 PetriNetUnfolderBase]: For 4390/4390 co-relation queries the response was YES. [2025-02-08 05:10:39,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 241980 conditions, 180357 events. 44367/180357 cut-off events. For 4390/4390 co-relation queries the response was YES. Maximal size of possible extension queue 5297. Compared 3110805 event pairs, 16632 based on Foata normal form. 0/161780 useless extension candidates. Maximal degree in co-relation 241973. Up to 30107 conditions per place. [2025-02-08 05:10:40,211 INFO L140 encePairwiseOnDemand]: 368/384 looper letters, 63 selfloop transitions, 12 changer transitions 0/339 dead transitions. [2025-02-08 05:10:40,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 339 transitions, 865 flow [2025-02-08 05:10:40,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:10:40,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:10:40,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 940 transitions. [2025-02-08 05:10:40,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8159722222222222 [2025-02-08 05:10:40,213 INFO L175 Difference]: Start difference. First operand has 306 places, 304 transitions, 630 flow. Second operand 3 states and 940 transitions. [2025-02-08 05:10:40,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 339 transitions, 865 flow [2025-02-08 05:10:40,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 339 transitions, 865 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:10:40,219 INFO L231 Difference]: Finished difference. Result has 310 places, 316 transitions, 734 flow [2025-02-08 05:10:40,220 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=384, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=306, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=310, PETRI_TRANSITIONS=316} [2025-02-08 05:10:40,221 INFO L279 CegarLoopForPetriNet]: 373 programPoint places, -63 predicate places. [2025-02-08 05:10:40,221 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 316 transitions, 734 flow [2025-02-08 05:10:40,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.3333333333333) internal successors, (865), 3 states have internal predecessors, (865), 0 states have call successors, (0), 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:40,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:10:40,222 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:40,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:10:40,222 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:40,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:10:40,223 INFO L85 PathProgramCache]: Analyzing trace with hash 1514562042, now seen corresponding path program 1 times [2025-02-08 05:10:40,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:10:40,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953194906] [2025-02-08 05:10:40,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:10:40,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:10:40,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-08 05:10:40,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-08 05:10:40,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:10:40,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:10:40,420 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:40,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:10:40,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953194906] [2025-02-08 05:10:40,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953194906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:10:40,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:10:40,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:10:40,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597289715] [2025-02-08 05:10:40,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:10:40,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:10:40,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:10:40,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:10:40,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:10:40,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 384 [2025-02-08 05:10:40,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 316 transitions, 734 flow. Second operand has 6 states, 6 states have (on average 278.6666666666667) internal successors, (1672), 6 states have internal predecessors, (1672), 0 states have call successors, (0), 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:40,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:10:40,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 384 [2025-02-08 05:10:40,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand