./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:39:06,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:39:06,224 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:39:06,229 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:39:06,229 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:39:06,249 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:39:06,250 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:39:06,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:39:06,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:39:06,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:39:06,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:39:06,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:39:06,251 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:39:06,252 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:39:06,252 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:39:06,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:39:06,252 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/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 -> eddb66a74cd149f880832378d52d5c02c94fd6efcf2d83aeade11bcdaaabe426 [2025-03-14 01:39:06,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:39:06,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:39:06,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:39:06,479 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:39:06,480 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:39:06,481 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-14 01:39:07,815 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5a95d27/22f28b071d644e43b5cf5df9033ef4c3/FLAG1386a6ee4 [2025-03-14 01:39:08,220 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:39:08,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_01-simple_racing.i [2025-03-14 01:39:08,235 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5a95d27/22f28b071d644e43b5cf5df9033ef4c3/FLAG1386a6ee4 [2025-03-14 01:39:08,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df5a95d27/22f28b071d644e43b5cf5df9033ef4c3 [2025-03-14 01:39:08,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:39:08,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:39:08,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:39:08,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:39:08,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:39:08,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,464 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52c1901a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08, skipping insertion in model container [2025-03-14 01:39:08,464 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,491 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:39:08,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:39:08,711 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:39:08,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:39:08,786 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:39:08,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08 WrapperNode [2025-03-14 01:39:08,787 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:39:08,788 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:39:08,789 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:39:08,789 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:39:08,794 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,808 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,824 INFO L138 Inliner]: procedures = 171, calls = 42, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-03-14 01:39:08,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:39:08,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:39:08,828 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:39:08,828 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:39:08,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,835 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,845 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,851 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,852 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,853 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:39:08,854 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:39:08,854 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:39:08,854 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:39:08,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (1/1) ... [2025-03-14 01:39:08,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:39:08,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:39:08,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:39:08,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:39:08,910 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-14 01:39:08,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:39:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:39:08,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:39:08,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:39:08,912 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:39:09,011 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:39:09,012 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:39:09,170 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L707: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-14 01:39:09,170 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L707-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-14 01:39:09,227 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:39:09,228 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:39:09,228 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:39:09,252 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:39:09,253 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:39:09 BoogieIcfgContainer [2025-03-14 01:39:09,253 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:39:09,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:39:09,255 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:39:09,258 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:39:09,258 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:39:08" (1/3) ... [2025-03-14 01:39:09,258 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:39:09, skipping insertion in model container [2025-03-14 01:39:09,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:39:08" (2/3) ... [2025-03-14 01:39:09,259 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b21932c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:39:09, skipping insertion in model container [2025-03-14 01:39:09,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:39:09" (3/3) ... [2025-03-14 01:39:09,260 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_01-simple_racing.i [2025-03-14 01:39:09,270 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:39:09,271 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_01-simple_racing.i that has 2 procedures, 133 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-14 01:39:09,272 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:39:09,326 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-14 01:39:09,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 144 transitions, 295 flow [2025-03-14 01:39:09,424 INFO L124 PetriNetUnfolderBase]: 15/201 cut-off events. [2025-03-14 01:39:09,427 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:39:09,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206 conditions, 201 events. 15/201 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 628 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 106. Up to 4 conditions per place. [2025-03-14 01:39:09,435 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 144 transitions, 295 flow [2025-03-14 01:39:09,442 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 144 transitions, 295 flow [2025-03-14 01:39:09,447 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:39:09,455 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;@4d3360af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:39:09,456 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-14 01:39:09,465 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:39:09,466 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-14 01:39:09,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:39:09,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:09,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:09,468 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:39:09,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:09,472 INFO L85 PathProgramCache]: Analyzing trace with hash 685736055, now seen corresponding path program 1 times [2025-03-14 01:39:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:09,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586561612] [2025-03-14 01:39:09,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:09,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:39:09,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:39:09,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:09,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:09,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:09,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586561612] [2025-03-14 01:39:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586561612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:09,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:39:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132867255] [2025-03-14 01:39:09,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:09,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:09,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:09,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:09,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:09,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 144 [2025-03-14 01:39:09,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 144 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-03-14 01:39:09,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:09,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 144 [2025-03-14 01:39:09,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:09,992 INFO L124 PetriNetUnfolderBase]: 48/499 cut-off events. [2025-03-14 01:39:09,992 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:39:09,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 620 conditions, 499 events. 48/499 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2302 event pairs, 28 based on Foata normal form. 48/496 useless extension candidates. Maximal degree in co-relation 542. Up to 108 conditions per place. [2025-03-14 01:39:09,996 INFO L140 encePairwiseOnDemand]: 131/144 looper letters, 22 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-03-14 01:39:09,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 138 transitions, 331 flow [2025-03-14 01:39:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:10,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:10,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2025-03-14 01:39:10,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8935185185185185 [2025-03-14 01:39:10,013 INFO L175 Difference]: Start difference. First operand has 136 places, 144 transitions, 295 flow. Second operand 3 states and 386 transitions. [2025-03-14 01:39:10,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 138 transitions, 331 flow [2025-03-14 01:39:10,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 331 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:39:10,024 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 279 flow [2025-03-14 01:39:10,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-03-14 01:39:10,031 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 1 predicate places. [2025-03-14 01:39:10,031 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 279 flow [2025-03-14 01:39:10,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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-03-14 01:39:10,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:10,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:39:10,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:39:10,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1834565491, now seen corresponding path program 1 times [2025-03-14 01:39:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-03-14 01:39:10,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:10,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:10,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:39:10,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:39:10,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:10,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020738020] [2025-03-14 01:39:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020738020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873384141] [2025-03-14 01:39:11,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:39:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:11,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:39:11,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:39:11,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 144 [2025-03-14 01:39:11,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 279 flow. Second operand has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 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-03-14 01:39:11,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:11,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 144 [2025-03-14 01:39:11,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:11,381 INFO L124 PetriNetUnfolderBase]: 108/632 cut-off events. [2025-03-14 01:39:11,382 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-14 01:39:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 915 conditions, 632 events. 108/632 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3550 event pairs, 55 based on Foata normal form. 0/581 useless extension candidates. Maximal degree in co-relation 822. Up to 181 conditions per place. [2025-03-14 01:39:11,386 INFO L140 encePairwiseOnDemand]: 138/144 looper letters, 48 selfloop transitions, 5 changer transitions 0/155 dead transitions. [2025-03-14 01:39:11,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 155 transitions, 431 flow [2025-03-14 01:39:11,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 672 transitions. [2025-03-14 01:39:11,394 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-14 01:39:11,395 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 279 flow. Second operand 6 states and 672 transitions. [2025-03-14 01:39:11,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 155 transitions, 431 flow [2025-03-14 01:39:11,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 155 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:11,399 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 283 flow [2025-03-14 01:39:11,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=283, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2025-03-14 01:39:11,401 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 3 predicate places. [2025-03-14 01:39:11,401 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 283 flow [2025-03-14 01:39:11,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 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-03-14 01:39:11,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:11,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:11,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:39:11,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:39:11,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash -907798778, now seen corresponding path program 1 times [2025-03-14 01:39:11,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:11,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-03-14 01:39:11,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:11,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:39:11,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:39:11,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:11,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:11,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:11,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:11,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626846737] [2025-03-14 01:39:11,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626846737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:11,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:11,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:11,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854095093] [2025-03-14 01:39:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:11,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:11,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:11,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:11,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:11,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 144 [2025-03-14 01:39:11,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 283 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-03-14 01:39:11,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:11,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 144 [2025-03-14 01:39:11,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:11,614 INFO L124 PetriNetUnfolderBase]: 91/792 cut-off events. [2025-03-14 01:39:11,614 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-14 01:39:11,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1028 conditions, 792 events. 91/792 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4665 event pairs, 30 based on Foata normal form. 0/722 useless extension candidates. Maximal degree in co-relation 959. Up to 125 conditions per place. [2025-03-14 01:39:11,617 INFO L140 encePairwiseOnDemand]: 135/144 looper letters, 30 selfloop transitions, 6 changer transitions 0/144 dead transitions. [2025-03-14 01:39:11,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 144 transitions, 384 flow [2025-03-14 01:39:11,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-03-14 01:39:11,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2025-03-14 01:39:11,619 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 283 flow. Second operand 3 states and 369 transitions. [2025-03-14 01:39:11,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 144 transitions, 384 flow [2025-03-14 01:39:11,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 144 transitions, 374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:39:11,622 INFO L231 Difference]: Finished difference. Result has 136 places, 133 transitions, 311 flow [2025-03-14 01:39:11,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=311, PETRI_PLACES=136, PETRI_TRANSITIONS=133} [2025-03-14 01:39:11,627 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 0 predicate places. [2025-03-14 01:39:11,627 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 133 transitions, 311 flow [2025-03-14 01:39:11,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 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-03-14 01:39:11,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:11,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:11,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:39:11,628 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:39:11,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:11,628 INFO L85 PathProgramCache]: Analyzing trace with hash 546477631, now seen corresponding path program 1 times [2025-03-14 01:39:11,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:11,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717750637] [2025-03-14 01:39:11,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:11,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:39:11,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:39:11,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:11,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:11,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:11,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:11,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717750637] [2025-03-14 01:39:11,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717750637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:11,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:11,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:11,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393549502] [2025-03-14 01:39:11,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:11,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:11,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:11,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:11,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:11,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 144 [2025-03-14 01:39:11,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 133 transitions, 311 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-03-14 01:39:11,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:11,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 144 [2025-03-14 01:39:11,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:11,805 INFO L124 PetriNetUnfolderBase]: 94/791 cut-off events. [2025-03-14 01:39:11,805 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2025-03-14 01:39:11,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 791 events. 94/791 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4757 event pairs, 60 based on Foata normal form. 0/721 useless extension candidates. Maximal degree in co-relation 1056. Up to 189 conditions per place. [2025-03-14 01:39:11,809 INFO L140 encePairwiseOnDemand]: 139/144 looper letters, 27 selfloop transitions, 4 changer transitions 0/140 dead transitions. [2025-03-14 01:39:11,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 140 transitions, 391 flow [2025-03-14 01:39:11,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:11,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:11,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-03-14 01:39:11,811 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449074074074074 [2025-03-14 01:39:11,811 INFO L175 Difference]: Start difference. First operand has 136 places, 133 transitions, 311 flow. Second operand 3 states and 365 transitions. [2025-03-14 01:39:11,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 140 transitions, 391 flow [2025-03-14 01:39:11,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 140 transitions, 377 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:11,816 INFO L231 Difference]: Finished difference. Result has 138 places, 136 transitions, 331 flow [2025-03-14 01:39:11,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=144, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=331, PETRI_PLACES=138, PETRI_TRANSITIONS=136} [2025-03-14 01:39:11,818 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, 2 predicate places. [2025-03-14 01:39:11,818 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 136 transitions, 331 flow [2025-03-14 01:39:11,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-03-14 01:39:11,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:11,818 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:11,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:39:11,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-14 01:39:11,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:11,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1689791727, now seen corresponding path program 1 times [2025-03-14 01:39:11,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:11,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595692407] [2025-03-14 01:39:11,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:11,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:11,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:39:11,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:39:11,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:11,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:11,846 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:39:11,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-14 01:39:11,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-14 01:39:11,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:11,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:11,881 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:39:11,881 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:39:11,882 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-14 01:39:11,883 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-14 01:39:11,884 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-14 01:39:11,885 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-14 01:39:11,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:39:11,886 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-14 01:39:11,888 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:39:11,888 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-14 01:39:11,915 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-14 01:39:11,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 179 places, 192 transitions, 400 flow [2025-03-14 01:39:11,948 INFO L124 PetriNetUnfolderBase]: 27/333 cut-off events. [2025-03-14 01:39:11,949 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-14 01:39:11,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 333 events. 27/333 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1175 event pairs, 0 based on Foata normal form. 0/284 useless extension candidates. Maximal degree in co-relation 203. Up to 6 conditions per place. [2025-03-14 01:39:11,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 179 places, 192 transitions, 400 flow [2025-03-14 01:39:11,955 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 192 transitions, 400 flow [2025-03-14 01:39:11,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:39:11,956 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;@4d3360af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:39:11,957 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-14 01:39:11,959 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:39:11,961 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-14 01:39:11,961 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:39:11,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:11,961 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:11,961 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:11,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 2041405559, now seen corresponding path program 1 times [2025-03-14 01:39:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:11,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318103789] [2025-03-14 01:39:11,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:11,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:39:11,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:39:11,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:11,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:11,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:12,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:12,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318103789] [2025-03-14 01:39:12,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318103789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:12,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:12,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:39:12,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533311259] [2025-03-14 01:39:12,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:12,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:12,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:12,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:12,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:12,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 192 [2025-03-14 01:39:12,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 192 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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-03-14 01:39:12,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:12,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 192 [2025-03-14 01:39:12,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:12,524 INFO L124 PetriNetUnfolderBase]: 788/4187 cut-off events. [2025-03-14 01:39:12,524 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-14 01:39:12,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5540 conditions, 4187 events. 788/4187 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 39255 event pairs, 632 based on Foata normal form. 562/4357 useless extension candidates. Maximal degree in co-relation 3459. Up to 1303 conditions per place. [2025-03-14 01:39:12,553 INFO L140 encePairwiseOnDemand]: 173/192 looper letters, 31 selfloop transitions, 2 changer transitions 0/181 dead transitions. [2025-03-14 01:39:12,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 181 transitions, 444 flow [2025-03-14 01:39:12,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:12,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:12,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2025-03-14 01:39:12,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8732638888888888 [2025-03-14 01:39:12,556 INFO L175 Difference]: Start difference. First operand has 179 places, 192 transitions, 400 flow. Second operand 3 states and 503 transitions. [2025-03-14 01:39:12,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 181 transitions, 444 flow [2025-03-14 01:39:12,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 181 transitions, 444 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:39:12,559 INFO L231 Difference]: Finished difference. Result has 180 places, 175 transitions, 376 flow [2025-03-14 01:39:12,559 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=180, PETRI_TRANSITIONS=175} [2025-03-14 01:39:12,560 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 1 predicate places. [2025-03-14 01:39:12,560 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 376 flow [2025-03-14 01:39:12,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 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-03-14 01:39:12,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:12,560 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:12,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:39:12,561 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:12,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:12,561 INFO L85 PathProgramCache]: Analyzing trace with hash -411256691, now seen corresponding path program 1 times [2025-03-14 01:39:12,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:12,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-03-14 01:39:12,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:12,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:12,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:39:12,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:39:12,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:12,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:12,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:12,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:12,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230524562] [2025-03-14 01:39:12,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230524562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:12,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:12,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:12,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300140358] [2025-03-14 01:39:12,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:12,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:39:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:12,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:39:12,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:39:13,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 192 [2025-03-14 01:39:13,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-03-14 01:39:13,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:13,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 192 [2025-03-14 01:39:13,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:14,002 INFO L124 PetriNetUnfolderBase]: 1718/6114 cut-off events. [2025-03-14 01:39:14,003 INFO L125 PetriNetUnfolderBase]: For 128/130 co-relation queries the response was YES. [2025-03-14 01:39:14,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9094 conditions, 6114 events. 1718/6114 cut-off events. For 128/130 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 58900 event pairs, 580 based on Foata normal form. 0/5643 useless extension candidates. Maximal degree in co-relation 6515. Up to 2015 conditions per place. [2025-03-14 01:39:14,032 INFO L140 encePairwiseOnDemand]: 186/192 looper letters, 80 selfloop transitions, 6 changer transitions 0/222 dead transitions. [2025-03-14 01:39:14,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 222 transitions, 642 flow [2025-03-14 01:39:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:14,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 908 transitions. [2025-03-14 01:39:14,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7881944444444444 [2025-03-14 01:39:14,037 INFO L175 Difference]: Start difference. First operand has 180 places, 175 transitions, 376 flow. Second operand 6 states and 908 transitions. [2025-03-14 01:39:14,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 222 transitions, 642 flow [2025-03-14 01:39:14,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 222 transitions, 640 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:39:14,041 INFO L231 Difference]: Finished difference. Result has 183 places, 174 transitions, 384 flow [2025-03-14 01:39:14,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=384, PETRI_PLACES=183, PETRI_TRANSITIONS=174} [2025-03-14 01:39:14,042 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 4 predicate places. [2025-03-14 01:39:14,042 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 174 transitions, 384 flow [2025-03-14 01:39:14,043 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 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-03-14 01:39:14,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:14,044 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:14,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:39:14,044 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:14,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:14,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1473543960, now seen corresponding path program 1 times [2025-03-14 01:39:14,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:14,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964544930] [2025-03-14 01:39:14,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:14,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:14,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:39:14,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:39:14,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:14,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:14,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:14,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:14,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964544930] [2025-03-14 01:39:14,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964544930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:14,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:14,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:14,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621618576] [2025-03-14 01:39:14,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:14,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:14,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:14,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:14,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:14,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 192 [2025-03-14 01:39:14,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 174 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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-03-14 01:39:14,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:14,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 192 [2025-03-14 01:39:14,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:15,472 INFO L124 PetriNetUnfolderBase]: 3895/14450 cut-off events. [2025-03-14 01:39:15,473 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2025-03-14 01:39:15,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21008 conditions, 14450 events. 3895/14450 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 161769 event pairs, 1409 based on Foata normal form. 0/12955 useless extension candidates. Maximal degree in co-relation 14553. Up to 3516 conditions per place. [2025-03-14 01:39:15,561 INFO L140 encePairwiseOnDemand]: 173/192 looper letters, 58 selfloop transitions, 14 changer transitions 0/207 dead transitions. [2025-03-14 01:39:15,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 207 transitions, 605 flow [2025-03-14 01:39:15,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:15,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2025-03-14 01:39:15,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8420138888888888 [2025-03-14 01:39:15,563 INFO L175 Difference]: Start difference. First operand has 183 places, 174 transitions, 384 flow. Second operand 3 states and 485 transitions. [2025-03-14 01:39:15,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 207 transitions, 605 flow [2025-03-14 01:39:15,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 207 transitions, 593 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:39:15,568 INFO L231 Difference]: Finished difference. Result has 182 places, 188 transitions, 494 flow [2025-03-14 01:39:15,568 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=182, PETRI_TRANSITIONS=188} [2025-03-14 01:39:15,570 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 3 predicate places. [2025-03-14 01:39:15,570 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 188 transitions, 494 flow [2025-03-14 01:39:15,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 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-03-14 01:39:15,570 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:15,571 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:15,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:39:15,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:15,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:15,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1782987309, now seen corresponding path program 1 times [2025-03-14 01:39:15,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:15,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-03-14 01:39:15,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:15,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:15,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:39:15,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:39:15,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:15,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:15,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:15,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329211153] [2025-03-14 01:39:15,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329211153] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:15,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:15,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:15,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197154751] [2025-03-14 01:39:15,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:15,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:15,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:15,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:15,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:15,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-14 01:39:15,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 188 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03-14 01:39:15,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:15,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-14 01:39:15,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:16,860 INFO L124 PetriNetUnfolderBase]: 4014/16225 cut-off events. [2025-03-14 01:39:16,860 INFO L125 PetriNetUnfolderBase]: For 4248/4425 co-relation queries the response was YES. [2025-03-14 01:39:16,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26903 conditions, 16225 events. 4014/16225 cut-off events. For 4248/4425 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 190394 event pairs, 2405 based on Foata normal form. 51/14772 useless extension candidates. Maximal degree in co-relation 13663. Up to 5485 conditions per place. [2025-03-14 01:39:17,043 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 52 selfloop transitions, 14 changer transitions 0/212 dead transitions. [2025-03-14 01:39:17,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 212 transitions, 712 flow [2025-03-14 01:39:17,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-14 01:39:17,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315972222222222 [2025-03-14 01:39:17,045 INFO L175 Difference]: Start difference. First operand has 182 places, 188 transitions, 494 flow. Second operand 3 states and 479 transitions. [2025-03-14 01:39:17,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 212 transitions, 712 flow [2025-03-14 01:39:17,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 212 transitions, 674 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:17,055 INFO L231 Difference]: Finished difference. Result has 184 places, 200 transitions, 592 flow [2025-03-14 01:39:17,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=184, PETRI_TRANSITIONS=200} [2025-03-14 01:39:17,055 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 5 predicate places. [2025-03-14 01:39:17,056 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 200 transitions, 592 flow [2025-03-14 01:39:17,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 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-03-14 01:39:17,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:17,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:39:17,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:39:17,056 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:17,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:17,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1663324472, now seen corresponding path program 1 times [2025-03-14 01:39:17,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:17,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104666576] [2025-03-14 01:39:17,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:17,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:17,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:39:17,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:39:17,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:17,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:39:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:17,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104666576] [2025-03-14 01:39:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104666576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:17,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:17,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:17,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558752031] [2025-03-14 01:39:17,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:17,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:39:17,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:17,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:39:17,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:39:17,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 192 [2025-03-14 01:39:17,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 200 transitions, 592 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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-03-14 01:39:17,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:17,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 192 [2025-03-14 01:39:17,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:18,459 INFO L124 PetriNetUnfolderBase]: 3076/17673 cut-off events. [2025-03-14 01:39:18,460 INFO L125 PetriNetUnfolderBase]: For 1402/1935 co-relation queries the response was YES. [2025-03-14 01:39:18,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25147 conditions, 17673 events. 3076/17673 cut-off events. For 1402/1935 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 230486 event pairs, 608 based on Foata normal form. 16/15815 useless extension candidates. Maximal degree in co-relation 11369. Up to 3818 conditions per place. [2025-03-14 01:39:18,533 INFO L140 encePairwiseOnDemand]: 187/192 looper letters, 56 selfloop transitions, 5 changer transitions 0/232 dead transitions. [2025-03-14 01:39:18,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 232 transitions, 778 flow [2025-03-14 01:39:18,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:18,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:18,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2025-03-14 01:39:18,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2025-03-14 01:39:18,535 INFO L175 Difference]: Start difference. First operand has 184 places, 200 transitions, 592 flow. Second operand 6 states and 944 transitions. [2025-03-14 01:39:18,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 232 transitions, 778 flow [2025-03-14 01:39:18,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 232 transitions, 750 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:18,542 INFO L231 Difference]: Finished difference. Result has 190 places, 202 transitions, 590 flow [2025-03-14 01:39:18,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=590, PETRI_PLACES=190, PETRI_TRANSITIONS=202} [2025-03-14 01:39:18,543 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 11 predicate places. [2025-03-14 01:39:18,543 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 202 transitions, 590 flow [2025-03-14 01:39:18,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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-03-14 01:39:18,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:18,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:18,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:39:18,544 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:18,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:18,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1197139330, now seen corresponding path program 1 times [2025-03-14 01:39:18,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:18,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-14 01:39:18,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:18,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:18,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:39:18,558 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:39:18,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:18,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:39:18,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:18,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452617232] [2025-03-14 01:39:18,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452617232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:18,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:18,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:18,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208413647] [2025-03-14 01:39:18,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:18,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:18,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:18,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:18,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:18,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-14 01:39:18,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 202 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-14 01:39:18,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:18,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-14 01:39:18,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:20,265 INFO L124 PetriNetUnfolderBase]: 4654/19844 cut-off events. [2025-03-14 01:39:20,265 INFO L125 PetriNetUnfolderBase]: For 5063/5252 co-relation queries the response was YES. [2025-03-14 01:39:20,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32363 conditions, 19844 events. 4654/19844 cut-off events. For 5063/5252 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 246766 event pairs, 2715 based on Foata normal form. 35/17833 useless extension candidates. Maximal degree in co-relation 32173. Up to 6268 conditions per place. [2025-03-14 01:39:20,353 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 59 selfloop transitions, 17 changer transitions 0/226 dead transitions. [2025-03-14 01:39:20,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 226 transitions, 825 flow [2025-03-14 01:39:20,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:20,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:20,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2025-03-14 01:39:20,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2025-03-14 01:39:20,355 INFO L175 Difference]: Start difference. First operand has 190 places, 202 transitions, 590 flow. Second operand 3 states and 478 transitions. [2025-03-14 01:39:20,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 226 transitions, 825 flow [2025-03-14 01:39:20,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 226 transitions, 819 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:20,359 INFO L231 Difference]: Finished difference. Result has 192 places, 215 transitions, 738 flow [2025-03-14 01:39:20,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=584, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=202, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=738, PETRI_PLACES=192, PETRI_TRANSITIONS=215} [2025-03-14 01:39:20,360 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 13 predicate places. [2025-03-14 01:39:20,360 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 215 transitions, 738 flow [2025-03-14 01:39:20,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 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-03-14 01:39:20,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:20,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:20,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:39:20,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:20,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1782047815, now seen corresponding path program 1 times [2025-03-14 01:39:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968722625] [2025-03-14 01:39:20,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:20,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:39:20,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:39:20,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:20,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:20,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:39:20,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:20,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968722625] [2025-03-14 01:39:20,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968722625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:20,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:20,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:20,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226785774] [2025-03-14 01:39:20,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:20,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:20,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:20,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:20,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:20,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 192 [2025-03-14 01:39:20,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 215 transitions, 738 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-14 01:39:20,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:20,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 192 [2025-03-14 01:39:20,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:22,112 INFO L124 PetriNetUnfolderBase]: 5220/22361 cut-off events. [2025-03-14 01:39:22,112 INFO L125 PetriNetUnfolderBase]: For 12697/13118 co-relation queries the response was YES. [2025-03-14 01:39:22,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39547 conditions, 22361 events. 5220/22361 cut-off events. For 12697/13118 co-relation queries the response was YES. Maximal size of possible extension queue 631. Compared 283933 event pairs, 2889 based on Foata normal form. 60/20140 useless extension candidates. Maximal degree in co-relation 39336. Up to 7039 conditions per place. [2025-03-14 01:39:22,241 INFO L140 encePairwiseOnDemand]: 183/192 looper letters, 71 selfloop transitions, 17 changer transitions 0/240 dead transitions. [2025-03-14 01:39:22,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 240 transitions, 1032 flow [2025-03-14 01:39:22,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 479 transitions. [2025-03-14 01:39:22,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8315972222222222 [2025-03-14 01:39:22,243 INFO L175 Difference]: Start difference. First operand has 192 places, 215 transitions, 738 flow. Second operand 3 states and 479 transitions. [2025-03-14 01:39:22,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 240 transitions, 1032 flow [2025-03-14 01:39:22,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 240 transitions, 992 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:39:22,263 INFO L231 Difference]: Finished difference. Result has 194 places, 228 transitions, 880 flow [2025-03-14 01:39:22,263 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=192, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=198, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=194, PETRI_TRANSITIONS=228} [2025-03-14 01:39:22,264 INFO L279 CegarLoopForPetriNet]: 179 programPoint places, 15 predicate places. [2025-03-14 01:39:22,264 INFO L471 AbstractCegarLoop]: Abstraction has has 194 places, 228 transitions, 880 flow [2025-03-14 01:39:22,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 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-03-14 01:39:22,264 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:22,269 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:22,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:39:22,269 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-14 01:39:22,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1772059838, now seen corresponding path program 1 times [2025-03-14 01:39:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680144215] [2025-03-14 01:39:22,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:22,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:22,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:39:22,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:39:22,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:22,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:22,316 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-14 01:39:22,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-14 01:39:22,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-14 01:39:22,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:22,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-14 01:39:22,337 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-14 01:39:22,338 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-14 01:39:22,338 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-14 01:39:22,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:39:22,338 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:22,339 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-14 01:39:22,339 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-14 01:39:22,364 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:39:22,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 222 places, 240 transitions, 507 flow [2025-03-14 01:39:22,395 INFO L124 PetriNetUnfolderBase]: 42/508 cut-off events. [2025-03-14 01:39:22,396 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-14 01:39:22,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533 conditions, 508 events. 42/508 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1971 event pairs, 1 based on Foata normal form. 0/434 useless extension candidates. Maximal degree in co-relation 341. Up to 12 conditions per place. [2025-03-14 01:39:22,401 INFO L82 GeneralOperation]: Start removeDead. Operand has 222 places, 240 transitions, 507 flow [2025-03-14 01:39:22,404 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 222 places, 240 transitions, 507 flow [2025-03-14 01:39:22,406 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:39:22,406 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;@4d3360af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:39:22,406 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-14 01:39:22,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:39:22,408 INFO L124 PetriNetUnfolderBase]: 0/52 cut-off events. [2025-03-14 01:39:22,408 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:39:22,409 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:22,409 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:22,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:39:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash -558974857, now seen corresponding path program 1 times [2025-03-14 01:39:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-14 01:39:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:22,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:22,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-14 01:39:22,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-14 01:39:22,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:22,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:22,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:22,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117633284] [2025-03-14 01:39:22,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117633284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:22,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:22,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:39:22,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927121157] [2025-03-14 01:39:22,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:22,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:22,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:22,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:22,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:22,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 240 [2025-03-14 01:39:22,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 240 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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-03-14 01:39:22,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:22,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 240 [2025-03-14 01:39:22,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:25,669 INFO L124 PetriNetUnfolderBase]: 8949/34641 cut-off events. [2025-03-14 01:39:25,670 INFO L125 PetriNetUnfolderBase]: For 943/943 co-relation queries the response was YES. [2025-03-14 01:39:25,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47885 conditions, 34641 events. 8949/34641 cut-off events. For 943/943 co-relation queries the response was YES. Maximal size of possible extension queue 788. Compared 446629 event pairs, 7791 based on Foata normal form. 5647/37038 useless extension candidates. Maximal degree in co-relation 29234. Up to 12807 conditions per place. [2025-03-14 01:39:26,003 INFO L140 encePairwiseOnDemand]: 215/240 looper letters, 39 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-14 01:39:26,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 223 transitions, 555 flow [2025-03-14 01:39:26,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:39:26,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:39:26,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 619 transitions. [2025-03-14 01:39:26,004 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597222222222223 [2025-03-14 01:39:26,004 INFO L175 Difference]: Start difference. First operand has 222 places, 240 transitions, 507 flow. Second operand 3 states and 619 transitions. [2025-03-14 01:39:26,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 223 transitions, 555 flow [2025-03-14 01:39:26,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 223 transitions, 555 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:39:26,007 INFO L231 Difference]: Finished difference. Result has 223 places, 217 transitions, 471 flow [2025-03-14 01:39:26,007 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=223, PETRI_TRANSITIONS=217} [2025-03-14 01:39:26,008 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 1 predicate places. [2025-03-14 01:39:26,008 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 217 transitions, 471 flow [2025-03-14 01:39:26,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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-03-14 01:39:26,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:26,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:26,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:39:26,008 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:39:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash 294137485, now seen corresponding path program 1 times [2025-03-14 01:39:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-03-14 01:39:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:26,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:26,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-14 01:39:26,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-14 01:39:26,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:26,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:26,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:26,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:26,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557025848] [2025-03-14 01:39:26,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557025848] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:26,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:26,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:39:26,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012755967] [2025-03-14 01:39:26,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:26,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:39:26,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:26,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:39:26,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:39:26,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 240 [2025-03-14 01:39:26,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 217 transitions, 471 flow. Second operand has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-03-14 01:39:26,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:26,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 240 [2025-03-14 01:39:26,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:39:31,303 INFO L124 PetriNetUnfolderBase]: 19563/53265 cut-off events. [2025-03-14 01:39:31,303 INFO L125 PetriNetUnfolderBase]: For 1427/1429 co-relation queries the response was YES. [2025-03-14 01:39:31,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82213 conditions, 53265 events. 19563/53265 cut-off events. For 1427/1429 co-relation queries the response was YES. Maximal size of possible extension queue 1320. Compared 652416 event pairs, 5270 based on Foata normal form. 0/49645 useless extension candidates. Maximal degree in co-relation 59099. Up to 20064 conditions per place. [2025-03-14 01:39:31,665 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 112 selfloop transitions, 6 changer transitions 0/288 dead transitions. [2025-03-14 01:39:31,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 288 transitions, 849 flow [2025-03-14 01:39:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:39:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:39:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1144 transitions. [2025-03-14 01:39:31,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7944444444444444 [2025-03-14 01:39:31,668 INFO L175 Difference]: Start difference. First operand has 223 places, 217 transitions, 471 flow. Second operand 6 states and 1144 transitions. [2025-03-14 01:39:31,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 288 transitions, 849 flow [2025-03-14 01:39:31,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 288 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:39:31,672 INFO L231 Difference]: Finished difference. Result has 226 places, 216 transitions, 479 flow [2025-03-14 01:39:31,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=226, PETRI_TRANSITIONS=216} [2025-03-14 01:39:31,673 INFO L279 CegarLoopForPetriNet]: 222 programPoint places, 4 predicate places. [2025-03-14 01:39:31,673 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 216 transitions, 479 flow [2025-03-14 01:39:31,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.5) internal successors, (1035), 6 states have internal predecessors, (1035), 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-03-14 01:39:31,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:39:31,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:39:31,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:39:31,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-14 01:39:31,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:39:31,675 INFO L85 PathProgramCache]: Analyzing trace with hash -1013298426, now seen corresponding path program 1 times [2025-03-14 01:39:31,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:39:31,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252507924] [2025-03-14 01:39:31,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:39:31,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:39:31,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-14 01:39:31,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-14 01:39:31,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:39:31,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:39:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:39:31,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:39:31,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252507924] [2025-03-14 01:39:31,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252507924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:39:31,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:39:31,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:39:31,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025031283] [2025-03-14 01:39:31,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:39:31,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:39:31,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:39:31,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:39:31,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:39:31,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 240 [2025-03-14 01:39:31,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 216 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 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-03-14 01:39:31,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:39:31,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 240 [2025-03-14 01:39:31,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand