./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:33,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:33,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:27:33,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:33,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:33,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:33,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:33,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:33,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:33,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:33,320 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:33,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:33,320 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:33,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:33,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:33,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:33,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:33,322 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:33,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:33,323 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:33,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:33,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:33,324 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 844ba080c7d33529db727776ee230d62edb7b62a6350a8061572438c458d73d3 [2025-01-09 21:27:33,590 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:33,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:33,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:33,604 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:33,606 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:33,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-01-09 21:27:34,870 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/655be22f1/1535b87a450e4049a7732ba2b72cd353/FLAG260be1cd1 [2025-01-09 21:27:35,162 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:35,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_42-trylock2_racefree.i [2025-01-09 21:27:35,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/655be22f1/1535b87a450e4049a7732ba2b72cd353/FLAG260be1cd1 [2025-01-09 21:27:35,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/655be22f1/1535b87a450e4049a7732ba2b72cd353 [2025-01-09 21:27:35,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:35,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:35,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:35,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:35,193 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:35,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4333af9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35, skipping insertion in model container [2025-01-09 21:27:35,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:35,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:35,586 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:35,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:35,675 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:35,676 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35 WrapperNode [2025-01-09 21:27:35,676 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:35,677 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:35,677 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:35,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:35,683 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,712 INFO L138 Inliner]: procedures = 172, calls = 61, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 165 [2025-01-09 21:27:35,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:35,713 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:35,713 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:35,713 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:35,719 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,723 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,733 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,742 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,744 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,752 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:35,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:35,755 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:35,755 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:35,756 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (1/1) ... [2025-01-09 21:27:35,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:35,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:35,787 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:27:35,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:35,812 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:35,812 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:35,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:35,813 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-01-09 21:27:35,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:35,813 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:35,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:35,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:35,815 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:27:35,957 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:35,959 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:36,332 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:36,332 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:36,401 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:36,402 INFO L312 CfgBuilder]: Removed 11 assume(true) statements. [2025-01-09 21:27:36,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:36 BoogieIcfgContainer [2025-01-09 21:27:36,402 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:36,404 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:36,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:36,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:36,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:35" (1/3) ... [2025-01-09 21:27:36,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cf25d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:36, skipping insertion in model container [2025-01-09 21:27:36,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:35" (2/3) ... [2025-01-09 21:27:36,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79cf25d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:36, skipping insertion in model container [2025-01-09 21:27:36,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:36" (3/3) ... [2025-01-09 21:27:36,411 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_42-trylock2_racefree.i [2025-01-09 21:27:36,421 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:36,424 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_42-trylock2_racefree.i that has 2 procedures, 240 locations, 1 initial locations, 13 loop locations, and 14 error locations. [2025-01-09 21:27:36,424 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:36,506 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:36,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 243 places, 271 transitions, 549 flow [2025-01-09 21:27:36,720 INFO L124 PetriNetUnfolderBase]: 49/409 cut-off events. [2025-01-09 21:27:36,724 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:36,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 414 conditions, 409 events. 49/409 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1922 event pairs, 0 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 232. Up to 6 conditions per place. [2025-01-09 21:27:36,740 INFO L82 GeneralOperation]: Start removeDead. Operand has 243 places, 271 transitions, 549 flow [2025-01-09 21:27:36,751 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 271 transitions, 549 flow [2025-01-09 21:27:36,763 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:36,775 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;@4836ec55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:36,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:27:36,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:36,791 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2025-01-09 21:27:36,791 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:36,791 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:36,791 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] [2025-01-09 21:27:36,792 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:36,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:36,798 INFO L85 PathProgramCache]: Analyzing trace with hash 358346371, now seen corresponding path program 1 times [2025-01-09 21:27:36,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:36,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739242325] [2025-01-09 21:27:36,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:36,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:36,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:27:36,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:27:36,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:36,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:37,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:37,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:37,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739242325] [2025-01-09 21:27:37,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739242325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:37,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:37,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:37,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379362021] [2025-01-09 21:27:37,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:37,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:37,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:37,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:37,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:37,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 271 [2025-01-09 21:27:37,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 271 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-01-09 21:27:37,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:37,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 271 [2025-01-09 21:27:37,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:37,665 INFO L124 PetriNetUnfolderBase]: 229/1869 cut-off events. [2025-01-09 21:27:37,665 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:27:37,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2342 conditions, 1869 events. 229/1869 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 12937 event pairs, 0 based on Foata normal form. 309/1995 useless extension candidates. Maximal degree in co-relation 2253. Up to 454 conditions per place. [2025-01-09 21:27:37,678 INFO L140 encePairwiseOnDemand]: 239/271 looper letters, 44 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-09 21:27:37,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 246 transitions, 591 flow [2025-01-09 21:27:37,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:37,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:37,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 700 transitions. [2025-01-09 21:27:37,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8610086100861009 [2025-01-09 21:27:37,699 INFO L175 Difference]: Start difference. First operand has 243 places, 271 transitions, 549 flow. Second operand 3 states and 700 transitions. [2025-01-09 21:27:37,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 246 transitions, 591 flow [2025-01-09 21:27:37,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 246 transitions, 591 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:37,713 INFO L231 Difference]: Finished difference. Result has 238 places, 234 transitions, 483 flow [2025-01-09 21:27:37,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=483, PETRI_PLACES=238, PETRI_TRANSITIONS=234} [2025-01-09 21:27:37,720 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2025-01-09 21:27:37,721 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 234 transitions, 483 flow [2025-01-09 21:27:37,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.0) internal successors, (618), 3 states have internal predecessors, (618), 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-01-09 21:27:37,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:37,722 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] [2025-01-09 21:27:37,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:27:37,722 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:37,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:37,724 INFO L85 PathProgramCache]: Analyzing trace with hash 953664605, now seen corresponding path program 1 times [2025-01-09 21:27:37,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:37,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949419597] [2025-01-09 21:27:37,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:37,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:37,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:27:37,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:27:37,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:37,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:38,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:38,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949419597] [2025-01-09 21:27:38,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949419597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:38,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:38,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104801615] [2025-01-09 21:27:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:38,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:38,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:38,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:38,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:38,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 271 [2025-01-09 21:27:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 234 transitions, 483 flow. Second operand has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-01-09 21:27:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 271 [2025-01-09 21:27:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:38,908 INFO L124 PetriNetUnfolderBase]: 349/2118 cut-off events. [2025-01-09 21:27:38,908 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:27:38,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2895 conditions, 2118 events. 349/2118 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 15458 event pairs, 13 based on Foata normal form. 0/1931 useless extension candidates. Maximal degree in co-relation 2801. Up to 587 conditions per place. [2025-01-09 21:27:38,923 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 88 selfloop transitions, 5 changer transitions 0/281 dead transitions. [2025-01-09 21:27:38,923 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 281 transitions, 763 flow [2025-01-09 21:27:38,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1246 transitions. [2025-01-09 21:27:38,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662976629766297 [2025-01-09 21:27:38,931 INFO L175 Difference]: Start difference. First operand has 238 places, 234 transitions, 483 flow. Second operand 6 states and 1246 transitions. [2025-01-09 21:27:38,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 281 transitions, 763 flow [2025-01-09 21:27:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 281 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:38,942 INFO L231 Difference]: Finished difference. Result has 240 places, 233 transitions, 487 flow [2025-01-09 21:27:38,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=240, PETRI_TRANSITIONS=233} [2025-01-09 21:27:38,943 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -3 predicate places. [2025-01-09 21:27:38,944 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 233 transitions, 487 flow [2025-01-09 21:27:38,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 193.5) internal successors, (1161), 6 states have internal predecessors, (1161), 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-01-09 21:27:38,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:38,945 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] [2025-01-09 21:27:38,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:27:38,945 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:38,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1825819190, now seen corresponding path program 1 times [2025-01-09 21:27:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034334163] [2025-01-09 21:27:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:38,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:27:38,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:27:38,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:38,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:39,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034334163] [2025-01-09 21:27:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034334163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485623599] [2025-01-09 21:27:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:39,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 271 [2025-01-09 21:27:39,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 233 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-01-09 21:27:39,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:39,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 271 [2025-01-09 21:27:39,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:39,606 INFO L124 PetriNetUnfolderBase]: 596/3781 cut-off events. [2025-01-09 21:27:39,606 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:27:39,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5039 conditions, 3781 events. 596/3781 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 31941 event pairs, 110 based on Foata normal form. 0/3422 useless extension candidates. Maximal degree in co-relation 4969. Up to 735 conditions per place. [2025-01-09 21:27:39,622 INFO L140 encePairwiseOnDemand]: 256/271 looper letters, 68 selfloop transitions, 10 changer transitions 0/266 dead transitions. [2025-01-09 21:27:39,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 266 transitions, 712 flow [2025-01-09 21:27:39,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:39,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:39,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-01-09 21:27:39,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8142681426814268 [2025-01-09 21:27:39,625 INFO L175 Difference]: Start difference. First operand has 240 places, 233 transitions, 487 flow. Second operand 3 states and 662 transitions. [2025-01-09 21:27:39,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 266 transitions, 712 flow [2025-01-09 21:27:39,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 266 transitions, 702 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:39,630 INFO L231 Difference]: Finished difference. Result has 237 places, 239 transitions, 551 flow [2025-01-09 21:27:39,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=473, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=551, PETRI_PLACES=237, PETRI_TRANSITIONS=239} [2025-01-09 21:27:39,631 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-01-09 21:27:39,631 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 239 transitions, 551 flow [2025-01-09 21:27:39,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 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-01-09 21:27:39,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:39,632 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] [2025-01-09 21:27:39,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:27:39,632 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:39,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:39,633 INFO L85 PathProgramCache]: Analyzing trace with hash -574711044, now seen corresponding path program 1 times [2025-01-09 21:27:39,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:39,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561545729] [2025-01-09 21:27:39,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:39,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:39,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:27:39,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:27:39,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:39,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:39,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:39,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561545729] [2025-01-09 21:27:39,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561545729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:39,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:39,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:39,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463241453] [2025-01-09 21:27:39,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:39,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:39,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:39,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:39,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:39,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 199 out of 271 [2025-01-09 21:27:39,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 239 transitions, 551 flow. Second operand has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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-01-09 21:27:39,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:39,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 199 of 271 [2025-01-09 21:27:39,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:40,229 INFO L124 PetriNetUnfolderBase]: 592/3799 cut-off events. [2025-01-09 21:27:40,230 INFO L125 PetriNetUnfolderBase]: For 412/416 co-relation queries the response was YES. [2025-01-09 21:27:40,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5431 conditions, 3799 events. 592/3799 cut-off events. For 412/416 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 32180 event pairs, 409 based on Foata normal form. 4/3437 useless extension candidates. Maximal degree in co-relation 5361. Up to 1109 conditions per place. [2025-01-09 21:27:40,250 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 57 selfloop transitions, 8 changer transitions 0/260 dead transitions. [2025-01-09 21:27:40,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 260 transitions, 739 flow [2025-01-09 21:27:40,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:40,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2025-01-09 21:27:40,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8068880688806888 [2025-01-09 21:27:40,254 INFO L175 Difference]: Start difference. First operand has 237 places, 239 transitions, 551 flow. Second operand 3 states and 656 transitions. [2025-01-09 21:27:40,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 260 transitions, 739 flow [2025-01-09 21:27:40,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 260 transitions, 713 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:40,263 INFO L231 Difference]: Finished difference. Result has 239 places, 246 transitions, 603 flow [2025-01-09 21:27:40,264 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=531, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=239, PETRI_TRANSITIONS=246} [2025-01-09 21:27:40,265 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -4 predicate places. [2025-01-09 21:27:40,265 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 246 transitions, 603 flow [2025-01-09 21:27:40,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 201.33333333333334) internal successors, (604), 3 states have internal predecessors, (604), 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-01-09 21:27:40,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:40,266 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] [2025-01-09 21:27:40,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:40,267 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:27:40,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:40,267 INFO L85 PathProgramCache]: Analyzing trace with hash 563783557, now seen corresponding path program 1 times [2025-01-09 21:27:40,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:40,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800884010] [2025-01-09 21:27:40,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:40,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:40,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:27:40,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:27:40,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:40,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:40,301 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:40,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:27:40,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:27:40,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:40,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:40,349 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:40,349 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:40,350 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:27:40,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:27:40,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:27:40,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:27:40,352 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:27:40,353 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:27:40,354 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:27:40,355 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:27:40,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:27:40,355 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:27:40,359 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:40,359 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:27:40,409 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:27:40,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 325 places, 364 transitions, 744 flow [2025-01-09 21:27:40,505 INFO L124 PetriNetUnfolderBase]: 81/667 cut-off events. [2025-01-09 21:27:40,506 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:27:40,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 667 events. 81/667 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3398 event pairs, 0 based on Foata normal form. 0/547 useless extension candidates. Maximal degree in co-relation 411. Up to 9 conditions per place. [2025-01-09 21:27:40,514 INFO L82 GeneralOperation]: Start removeDead. Operand has 325 places, 364 transitions, 744 flow [2025-01-09 21:27:40,522 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 364 transitions, 744 flow [2025-01-09 21:27:40,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:40,523 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;@4836ec55, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:40,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2025-01-09 21:27:40,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:40,529 INFO L124 PetriNetUnfolderBase]: 1/59 cut-off events. [2025-01-09 21:27:40,529 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:40,530 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:40,530 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] [2025-01-09 21:27:40,530 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:27:40,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:40,531 INFO L85 PathProgramCache]: Analyzing trace with hash -140549649, now seen corresponding path program 1 times [2025-01-09 21:27:40,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:40,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493988823] [2025-01-09 21:27:40,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:40,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:40,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:27:40,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:27:40,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:40,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:40,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:40,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:40,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493988823] [2025-01-09 21:27:40,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493988823] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:40,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:40,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906986301] [2025-01-09 21:27:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:40,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:40,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:40,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:40,618 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 271 out of 364 [2025-01-09 21:27:40,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 364 transitions, 744 flow. Second operand has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-01-09 21:27:40,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:40,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 271 of 364 [2025-01-09 21:27:40,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:44,365 INFO L124 PetriNetUnfolderBase]: 6064/28899 cut-off events. [2025-01-09 21:27:44,366 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-09 21:27:44,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38498 conditions, 28899 events. 6064/28899 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 360660 event pairs, 5747 based on Foata normal form. 6085/32317 useless extension candidates. Maximal degree in co-relation 33167. Up to 9513 conditions per place. [2025-01-09 21:27:44,606 INFO L140 encePairwiseOnDemand]: 320/364 looper letters, 59 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2025-01-09 21:27:44,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 328 transitions, 794 flow [2025-01-09 21:27:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:44,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 928 transitions. [2025-01-09 21:27:44,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8498168498168498 [2025-01-09 21:27:44,610 INFO L175 Difference]: Start difference. First operand has 325 places, 364 transitions, 744 flow. Second operand 3 states and 928 transitions. [2025-01-09 21:27:44,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 328 transitions, 794 flow [2025-01-09 21:27:44,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 328 transitions, 794 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:44,617 INFO L231 Difference]: Finished difference. Result has 320 places, 316 transitions, 658 flow [2025-01-09 21:27:44,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=320, PETRI_TRANSITIONS=316} [2025-01-09 21:27:44,618 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -5 predicate places. [2025-01-09 21:27:44,618 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 316 transitions, 658 flow [2025-01-09 21:27:44,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 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-01-09 21:27:44,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:44,619 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] [2025-01-09 21:27:44,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:44,620 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:27:44,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:44,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1744029111, now seen corresponding path program 1 times [2025-01-09 21:27:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473011194] [2025-01-09 21:27:44,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:44,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:44,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:27:44,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:27:44,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:44,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:44,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:44,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:44,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473011194] [2025-01-09 21:27:44,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473011194] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:44,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:44,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:44,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200168932] [2025-01-09 21:27:44,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:44,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:44,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:44,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:44,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:45,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 259 out of 364 [2025-01-09 21:27:45,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 316 transitions, 658 flow. Second operand has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:45,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:45,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 259 of 364 [2025-01-09 21:27:45,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:48,230 INFO L124 PetriNetUnfolderBase]: 9520/33443 cut-off events. [2025-01-09 21:27:48,230 INFO L125 PetriNetUnfolderBase]: For 317/317 co-relation queries the response was YES. [2025-01-09 21:27:48,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48619 conditions, 33443 events. 9520/33443 cut-off events. For 317/317 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 401940 event pairs, 804 based on Foata normal form. 0/30800 useless extension candidates. Maximal degree in co-relation 46145. Up to 11851 conditions per place. [2025-01-09 21:27:48,617 INFO L140 encePairwiseOnDemand]: 358/364 looper letters, 150 selfloop transitions, 6 changer transitions 0/411 dead transitions. [2025-01-09 21:27:48,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 411 transitions, 1160 flow [2025-01-09 21:27:48,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:48,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1710 transitions. [2025-01-09 21:27:48,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.782967032967033 [2025-01-09 21:27:48,639 INFO L175 Difference]: Start difference. First operand has 320 places, 316 transitions, 658 flow. Second operand 6 states and 1710 transitions. [2025-01-09 21:27:48,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 411 transitions, 1160 flow [2025-01-09 21:27:48,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 411 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:48,655 INFO L231 Difference]: Finished difference. Result has 323 places, 315 transitions, 666 flow [2025-01-09 21:27:48,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=666, PETRI_PLACES=323, PETRI_TRANSITIONS=315} [2025-01-09 21:27:48,657 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -2 predicate places. [2025-01-09 21:27:48,657 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 315 transitions, 666 flow [2025-01-09 21:27:48,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 260.5) internal successors, (1563), 6 states have internal predecessors, (1563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:48,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:48,662 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] [2025-01-09 21:27:48,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:48,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:27:48,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:48,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1618411887, now seen corresponding path program 1 times [2025-01-09 21:27:48,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:48,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648422594] [2025-01-09 21:27:48,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:48,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:48,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-01-09 21:27:48,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-01-09 21:27:48,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:48,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:48,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:48,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:48,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648422594] [2025-01-09 21:27:48,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648422594] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:48,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:48,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160259878] [2025-01-09 21:27:48,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:48,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:48,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:48,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:48,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:48,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 364 [2025-01-09 21:27:48,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 315 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-01-09 21:27:48,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:48,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 364 [2025-01-09 21:27:48,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:58,108 INFO L124 PetriNetUnfolderBase]: 30961/107498 cut-off events. [2025-01-09 21:27:58,109 INFO L125 PetriNetUnfolderBase]: For 328/328 co-relation queries the response was YES. [2025-01-09 21:27:58,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156029 conditions, 107498 events. 30961/107498 cut-off events. For 328/328 co-relation queries the response was YES. Maximal size of possible extension queue 1586. Compared 1524089 event pairs, 10272 based on Foata normal form. 0/96173 useless extension candidates. Maximal degree in co-relation 150881. Up to 26160 conditions per place. [2025-01-09 21:27:58,834 INFO L140 encePairwiseOnDemand]: 339/364 looper letters, 108 selfloop transitions, 18 changer transitions 0/374 dead transitions. [2025-01-09 21:27:58,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 374 transitions, 1047 flow [2025-01-09 21:27:58,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 889 transitions. [2025-01-09 21:27:58,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8141025641025641 [2025-01-09 21:27:58,837 INFO L175 Difference]: Start difference. First operand has 323 places, 315 transitions, 666 flow. Second operand 3 states and 889 transitions. [2025-01-09 21:27:58,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 374 transitions, 1047 flow [2025-01-09 21:27:58,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 374 transitions, 1035 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:58,846 INFO L231 Difference]: Finished difference. Result has 322 places, 333 transitions, 812 flow [2025-01-09 21:27:58,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=322, PETRI_TRANSITIONS=333} [2025-01-09 21:27:58,848 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -3 predicate places. [2025-01-09 21:27:58,848 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 333 transitions, 812 flow [2025-01-09 21:27:58,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 253.66666666666666) internal successors, (761), 3 states have internal predecessors, (761), 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-01-09 21:27:58,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:58,849 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:58,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:58,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:27:58,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:58,850 INFO L85 PathProgramCache]: Analyzing trace with hash -2144907795, now seen corresponding path program 1 times [2025-01-09 21:27:58,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:58,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102906511] [2025-01-09 21:27:58,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:58,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:58,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:27:58,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:27:58,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:58,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:58,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:58,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:58,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102906511] [2025-01-09 21:27:58,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102906511] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:58,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:58,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:58,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130480262] [2025-01-09 21:27:58,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:58,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:58,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:58,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:58,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:58,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 364 [2025-01-09 21:27:58,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 333 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:27:58,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:58,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 364 [2025-01-09 21:27:58,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:10,449 INFO L124 PetriNetUnfolderBase]: 30282/120182 cut-off events. [2025-01-09 21:28:10,449 INFO L125 PetriNetUnfolderBase]: For 20321/20851 co-relation queries the response was YES. [2025-01-09 21:28:10,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187018 conditions, 120182 events. 30282/120182 cut-off events. For 20321/20851 co-relation queries the response was YES. Maximal size of possible extension queue 1761. Compared 1796864 event pairs, 21308 based on Foata normal form. 148/109151 useless extension candidates. Maximal degree in co-relation 121149. Up to 42544 conditions per place. [2025-01-09 21:28:11,016 INFO L140 encePairwiseOnDemand]: 353/364 looper letters, 94 selfloop transitions, 18 changer transitions 0/377 dead transitions. [2025-01-09 21:28:11,016 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 377 transitions, 1174 flow [2025-01-09 21:28:11,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:11,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 881 transitions. [2025-01-09 21:28:11,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8067765567765568 [2025-01-09 21:28:11,019 INFO L175 Difference]: Start difference. First operand has 322 places, 333 transitions, 812 flow. Second operand 3 states and 881 transitions. [2025-01-09 21:28:11,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 377 transitions, 1174 flow [2025-01-09 21:28:11,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 377 transitions, 1124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:11,076 INFO L231 Difference]: Finished difference. Result has 324 places, 349 transitions, 942 flow [2025-01-09 21:28:11,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=776, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=942, PETRI_PLACES=324, PETRI_TRANSITIONS=349} [2025-01-09 21:28:11,078 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, -1 predicate places. [2025-01-09 21:28:11,079 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 349 transitions, 942 flow [2025-01-09 21:28:11,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-01-09 21:28:11,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:11,080 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] [2025-01-09 21:28:11,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:28:11,080 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:28:11,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:11,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1689948645, now seen corresponding path program 1 times [2025-01-09 21:28:11,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:11,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591833953] [2025-01-09 21:28:11,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:11,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:11,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:28:11,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:28:11,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:11,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:11,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591833953] [2025-01-09 21:28:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591833953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444669756] [2025-01-09 21:28:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:28:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:28:11,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:28:11,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 364 [2025-01-09 21:28:11,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 349 transitions, 942 flow. Second operand has 5 states, 5 states have (on average 271.4) internal successors, (1357), 5 states have internal predecessors, (1357), 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-01-09 21:28:11,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:11,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 364 [2025-01-09 21:28:11,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:21,495 INFO L124 PetriNetUnfolderBase]: 21880/103666 cut-off events. [2025-01-09 21:28:21,496 INFO L125 PetriNetUnfolderBase]: For 5745/7218 co-relation queries the response was YES. [2025-01-09 21:28:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148966 conditions, 103666 events. 21880/103666 cut-off events. For 5745/7218 co-relation queries the response was YES. Maximal size of possible extension queue 1675. Compared 1607241 event pairs, 4932 based on Foata normal form. 73/94609 useless extension candidates. Maximal degree in co-relation 92155. Up to 30220 conditions per place. [2025-01-09 21:28:22,239 INFO L140 encePairwiseOnDemand]: 359/364 looper letters, 108 selfloop transitions, 5 changer transitions 0/411 dead transitions. [2025-01-09 21:28:22,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 411 transitions, 1292 flow [2025-01-09 21:28:22,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1728 transitions. [2025-01-09 21:28:22,244 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7912087912087912 [2025-01-09 21:28:22,244 INFO L175 Difference]: Start difference. First operand has 324 places, 349 transitions, 942 flow. Second operand 6 states and 1728 transitions. [2025-01-09 21:28:22,247 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 411 transitions, 1292 flow [2025-01-09 21:28:22,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 411 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:22,277 INFO L231 Difference]: Finished difference. Result has 330 places, 351 transitions, 932 flow [2025-01-09 21:28:22,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=364, PETRI_DIFFERENCE_MINUEND_FLOW=906, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=932, PETRI_PLACES=330, PETRI_TRANSITIONS=351} [2025-01-09 21:28:22,278 INFO L279 CegarLoopForPetriNet]: 325 programPoint places, 5 predicate places. [2025-01-09 21:28:22,278 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 351 transitions, 932 flow [2025-01-09 21:28:22,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 271.4) internal successors, (1357), 5 states have internal predecessors, (1357), 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-01-09 21:28:22,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:22,280 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, 1, 1] [2025-01-09 21:28:22,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:28:22,280 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 28 more)] === [2025-01-09 21:28:22,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:22,281 INFO L85 PathProgramCache]: Analyzing trace with hash 2100245874, now seen corresponding path program 1 times [2025-01-09 21:28:22,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:22,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719119936] [2025-01-09 21:28:22,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:22,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:22,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:28:22,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:28:22,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:22,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:22,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:22,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:22,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719119936] [2025-01-09 21:28:22,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719119936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:22,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:22,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:28:22,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026256429] [2025-01-09 21:28:22,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:22,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:22,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:22,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:22,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:22,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 364 [2025-01-09 21:28:22,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 351 transitions, 932 flow. Second operand has 3 states, 3 states have (on average 264.6666666666667) internal successors, (794), 3 states have internal predecessors, (794), 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-01-09 21:28:22,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:22,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 364 [2025-01-09 21:28:22,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand