./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.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/09-regions_03-list2_rc.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 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:23:07,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:23:07,855 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:23:07,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:23:07,858 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:23:07,881 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:23:07,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:23:07,882 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:23:07,882 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:23:07,882 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:23:07,882 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:23:07,882 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:23:07,882 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:23:07,883 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:23:07,883 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:07,883 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:07,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:07,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:23:07,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:23:07,884 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 -> 8fabb88ade703ed67646ecdb87c815e5ac82dedce1b2b43f0f0859c8695912d8 [2025-01-09 21:23:08,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:23:08,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:23:08,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:23:08,114 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:23:08,115 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:23:08,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-01-09 21:23:09,263 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02627077c/93b33322dd2c40278f757db1c2d08f9b/FLAGb5b5e6603 [2025-01-09 21:23:09,584 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:23:09,585 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_03-list2_rc.i [2025-01-09 21:23:09,604 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02627077c/93b33322dd2c40278f757db1c2d08f9b/FLAGb5b5e6603 [2025-01-09 21:23:09,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/02627077c/93b33322dd2c40278f757db1c2d08f9b [2025-01-09 21:23:09,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:23:09,821 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:23:09,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:09,822 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:23:09,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:23:09,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:09" (1/1) ... [2025-01-09 21:23:09,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@294a2e42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:09, skipping insertion in model container [2025-01-09 21:23:09,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:23:09" (1/1) ... [2025-01-09 21:23:09,862 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:23:10,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:10,214 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:23:10,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:23:10,299 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:23:10,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10 WrapperNode [2025-01-09 21:23:10,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:23:10,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:10,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:23:10,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:23:10,307 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:23:10" (1/1) ... [2025-01-09 21:23:10,328 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:23:10" (1/1) ... [2025-01-09 21:23:10,357 INFO L138 Inliner]: procedures = 368, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2025-01-09 21:23:10,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:23:10,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:23:10,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:23:10,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:23:10,364 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,370 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,371 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,381 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,383 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,387 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,389 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:23:10,390 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:23:10,390 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:23:10,390 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:23:10,391 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (1/1) ... [2025-01-09 21:23:10,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:23:10,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:10,427 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:23:10,433 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:23:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:23:10,445 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:23:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:23:10,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:23:10,446 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:23:10,447 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:23:10,557 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:23:10,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:23:10,979 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:23:10,979 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:23:11,005 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:23:11,006 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:23:11,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:11 BoogieIcfgContainer [2025-01-09 21:23:11,006 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:23:11,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:23:11,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:23:11,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:23:11,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:23:09" (1/3) ... [2025-01-09 21:23:11,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70709df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:11, skipping insertion in model container [2025-01-09 21:23:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:23:10" (2/3) ... [2025-01-09 21:23:11,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70709df3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:11, skipping insertion in model container [2025-01-09 21:23:11,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:11" (3/3) ... [2025-01-09 21:23:11,015 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_03-list2_rc.i [2025-01-09 21:23:11,024 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:23:11,026 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_03-list2_rc.i that has 2 procedures, 277 locations, 1 initial locations, 0 loop locations, and 28 error locations. [2025-01-09 21:23:11,026 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:23:11,075 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:23:11,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 280 places, 276 transitions, 556 flow [2025-01-09 21:23:11,179 INFO L124 PetriNetUnfolderBase]: 0/275 cut-off events. [2025-01-09 21:23:11,181 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:11,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 275 events. 0/275 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 160 event pairs, 0 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:23:11,184 INFO L82 GeneralOperation]: Start removeDead. Operand has 280 places, 276 transitions, 556 flow [2025-01-09 21:23:11,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 279 places, 275 transitions, 553 flow [2025-01-09 21:23:11,196 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:23:11,208 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;@6fca15be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:23:11,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-09 21:23:11,215 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:23:11,215 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:23:11,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:11,215 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:11,216 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] [2025-01-09 21:23:11,217 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:11,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:11,221 INFO L85 PathProgramCache]: Analyzing trace with hash -528824746, now seen corresponding path program 1 times [2025-01-09 21:23:11,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393106573] [2025-01-09 21:23:11,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:11,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:23:11,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:23:11,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:11,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:11,812 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:23:11,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:11,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393106573] [2025-01-09 21:23:11,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393106573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:11,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:11,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:11,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87207523] [2025-01-09 21:23:11,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:11,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:11,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:11,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:11,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:12,347 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-01-09 21:23:12,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 275 transitions, 553 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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:23:12,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:12,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-01-09 21:23:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:12,816 INFO L124 PetriNetUnfolderBase]: 560/2325 cut-off events. [2025-01-09 21:23:12,816 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:12,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3537 conditions, 2325 events. 560/2325 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14858 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3350. Up to 1193 conditions per place. [2025-01-09 21:23:12,840 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/272 dead transitions. [2025-01-09 21:23:12,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 281 places, 272 transitions, 721 flow [2025-01-09 21:23:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:12,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-01-09 21:23:12,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-01-09 21:23:12,866 INFO L175 Difference]: Start difference. First operand has 279 places, 275 transitions, 553 flow. Second operand 6 states and 1206 transitions. [2025-01-09 21:23:12,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 281 places, 272 transitions, 721 flow [2025-01-09 21:23:12,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 272 transitions, 720 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:12,876 INFO L231 Difference]: Finished difference. Result has 280 places, 272 transitions, 576 flow [2025-01-09 21:23:12,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=576, PETRI_PLACES=280, PETRI_TRANSITIONS=272} [2025-01-09 21:23:12,881 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-01-09 21:23:12,881 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 272 transitions, 576 flow [2025-01-09 21:23:12,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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:23:12,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:12,882 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:23:12,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:23:12,882 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:12,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:12,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1092997858, now seen corresponding path program 1 times [2025-01-09 21:23:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:12,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602728573] [2025-01-09 21:23:12,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:12,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:12,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:23:12,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:23:12,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:12,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:13,200 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:23:13,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:13,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602728573] [2025-01-09 21:23:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602728573] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:13,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582974785] [2025-01-09 21:23:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:13,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:13,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:13,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 186 out of 276 [2025-01-09 21:23:13,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 272 transitions, 576 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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:23:13,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:13,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 186 of 276 [2025-01-09 21:23:13,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:13,852 INFO L124 PetriNetUnfolderBase]: 560/2322 cut-off events. [2025-01-09 21:23:13,852 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:13,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3549 conditions, 2322 events. 560/2322 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14859 event pairs, 560 based on Foata normal form. 0/2115 useless extension candidates. Maximal degree in co-relation 3391. Up to 1193 conditions per place. [2025-01-09 21:23:13,861 INFO L140 encePairwiseOnDemand]: 258/276 looper letters, 72 selfloop transitions, 15 changer transitions 0/269 dead transitions. [2025-01-09 21:23:13,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 269 transitions, 744 flow [2025-01-09 21:23:13,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:13,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2025-01-09 21:23:13,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7282608695652174 [2025-01-09 21:23:13,870 INFO L175 Difference]: Start difference. First operand has 280 places, 272 transitions, 576 flow. Second operand 6 states and 1206 transitions. [2025-01-09 21:23:13,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 269 transitions, 744 flow [2025-01-09 21:23:13,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 269 transitions, 714 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:13,877 INFO L231 Difference]: Finished difference. Result has 277 places, 269 transitions, 570 flow [2025-01-09 21:23:13,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=570, PETRI_PLACES=277, PETRI_TRANSITIONS=269} [2025-01-09 21:23:13,878 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -2 predicate places. [2025-01-09 21:23:13,878 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 269 transitions, 570 flow [2025-01-09 21:23:13,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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:23:13,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:13,880 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] [2025-01-09 21:23:13,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:23:13,880 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:13,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:13,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1560868144, now seen corresponding path program 1 times [2025-01-09 21:23:13,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:13,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284976557] [2025-01-09 21:23:13,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:13,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:13,897 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:23:13,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:23:13,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:13,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:13,926 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:23:13,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:13,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284976557] [2025-01-09 21:23:13,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284976557] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:13,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:13,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:13,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482853913] [2025-01-09 21:23:13,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:13,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:13,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:13,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:13,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:13,945 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-01-09 21:23:13,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 269 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:23:13,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:13,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-01-09 21:23:13,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:14,010 INFO L124 PetriNetUnfolderBase]: 30/718 cut-off events. [2025-01-09 21:23:14,010 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:14,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 718 events. 30/718 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2616 event pairs, 30 based on Foata normal form. 0/643 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-01-09 21:23:14,013 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2025-01-09 21:23:14,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 268 transitions, 606 flow [2025-01-09 21:23:14,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-01-09 21:23:14,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-01-09 21:23:14,014 INFO L175 Difference]: Start difference. First operand has 277 places, 269 transitions, 570 flow. Second operand 3 states and 788 transitions. [2025-01-09 21:23:14,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 268 transitions, 606 flow [2025-01-09 21:23:14,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 268 transitions, 576 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:14,018 INFO L231 Difference]: Finished difference. Result has 273 places, 268 transitions, 542 flow [2025-01-09 21:23:14,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=538, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=273, PETRI_TRANSITIONS=268} [2025-01-09 21:23:14,018 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -6 predicate places. [2025-01-09 21:23:14,019 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 268 transitions, 542 flow [2025-01-09 21:23:14,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:23:14,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:14,019 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:14,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:23:14,019 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:14,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:14,020 INFO L85 PathProgramCache]: Analyzing trace with hash -388730026, now seen corresponding path program 1 times [2025-01-09 21:23:14,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:14,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217713090] [2025-01-09 21:23:14,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:14,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:14,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:23:14,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:23:14,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:14,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,075 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:23:14,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:14,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217713090] [2025-01-09 21:23:14,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217713090] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:14,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:14,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:14,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104844364] [2025-01-09 21:23:14,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:14,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:14,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:14,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:14,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:14,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-01-09 21:23:14,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 268 transitions, 542 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:23:14,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:14,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-01-09 21:23:14,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:14,150 INFO L124 PetriNetUnfolderBase]: 36/750 cut-off events. [2025-01-09 21:23:14,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:14,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 750 events. 36/750 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2996 event pairs, 36 based on Foata normal form. 0/681 useless extension candidates. Maximal degree in co-relation 788. Up to 89 conditions per place. [2025-01-09 21:23:14,153 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/264 dead transitions. [2025-01-09 21:23:14,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 264 transitions, 570 flow [2025-01-09 21:23:14,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:14,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:14,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-01-09 21:23:14,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-01-09 21:23:14,155 INFO L175 Difference]: Start difference. First operand has 273 places, 268 transitions, 542 flow. Second operand 3 states and 784 transitions. [2025-01-09 21:23:14,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 264 transitions, 570 flow [2025-01-09 21:23:14,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 264 transitions, 566 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:14,158 INFO L231 Difference]: Finished difference. Result has 269 places, 264 transitions, 532 flow [2025-01-09 21:23:14,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=532, PETRI_PLACES=269, PETRI_TRANSITIONS=264} [2025-01-09 21:23:14,159 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -10 predicate places. [2025-01-09 21:23:14,159 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 264 transitions, 532 flow [2025-01-09 21:23:14,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:23:14,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:14,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:14,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:23:14,160 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:14,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:14,160 INFO L85 PathProgramCache]: Analyzing trace with hash -744891557, now seen corresponding path program 1 times [2025-01-09 21:23:14,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:14,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057425626] [2025-01-09 21:23:14,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:14,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:14,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:23:14,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:23:14,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:14,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:14,551 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:23:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057425626] [2025-01-09 21:23:14,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057425626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:14,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:14,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:14,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389495044] [2025-01-09 21:23:14,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:14,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:14,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:14,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:14,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:14,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-01-09 21:23:14,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 264 transitions, 532 flow. Second operand has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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:23:14,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:14,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-01-09 21:23:14,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:15,087 INFO L124 PetriNetUnfolderBase]: 638/2519 cut-off events. [2025-01-09 21:23:15,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:15,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3891 conditions, 2519 events. 638/2519 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16283 event pairs, 638 based on Foata normal form. 0/2317 useless extension candidates. Maximal degree in co-relation 3822. Up to 1362 conditions per place. [2025-01-09 21:23:15,097 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/263 dead transitions. [2025-01-09 21:23:15,097 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 263 transitions, 710 flow [2025-01-09 21:23:15,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-01-09 21:23:15,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-01-09 21:23:15,099 INFO L175 Difference]: Start difference. First operand has 269 places, 264 transitions, 532 flow. Second operand 6 states and 1201 transitions. [2025-01-09 21:23:15,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 263 transitions, 710 flow [2025-01-09 21:23:15,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 263 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:15,103 INFO L231 Difference]: Finished difference. Result has 272 places, 263 transitions, 539 flow [2025-01-09 21:23:15,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=263, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=539, PETRI_PLACES=272, PETRI_TRANSITIONS=263} [2025-01-09 21:23:15,103 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -7 predicate places. [2025-01-09 21:23:15,103 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 263 transitions, 539 flow [2025-01-09 21:23:15,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 189.16666666666666) internal successors, (1135), 6 states have internal predecessors, (1135), 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:23:15,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:15,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:15,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:23:15,104 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:15,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:15,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1605273385, now seen corresponding path program 1 times [2025-01-09 21:23:15,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:15,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141947250] [2025-01-09 21:23:15,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:15,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:15,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:23:15,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:23:15,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:15,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:15,155 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:23:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141947250] [2025-01-09 21:23:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141947250] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:15,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:15,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:15,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539917897] [2025-01-09 21:23:15,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:15,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:15,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:15,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:15,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:15,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 276 [2025-01-09 21:23:15,189 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 263 transitions, 539 flow. Second operand has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:23:15,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:15,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 276 [2025-01-09 21:23:15,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:15,245 INFO L124 PetriNetUnfolderBase]: 30/706 cut-off events. [2025-01-09 21:23:15,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:15,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 796 conditions, 706 events. 30/706 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2689 event pairs, 30 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 737. Up to 78 conditions per place. [2025-01-09 21:23:15,248 INFO L140 encePairwiseOnDemand]: 273/276 looper letters, 17 selfloop transitions, 2 changer transitions 0/262 dead transitions. [2025-01-09 21:23:15,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 262 transitions, 575 flow [2025-01-09 21:23:15,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:15,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 788 transitions. [2025-01-09 21:23:15,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516908212560387 [2025-01-09 21:23:15,250 INFO L175 Difference]: Start difference. First operand has 272 places, 263 transitions, 539 flow. Second operand 3 states and 788 transitions. [2025-01-09 21:23:15,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 262 transitions, 575 flow [2025-01-09 21:23:15,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 262 transitions, 565 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:15,253 INFO L231 Difference]: Finished difference. Result has 268 places, 262 transitions, 531 flow [2025-01-09 21:23:15,253 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=527, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=260, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=531, PETRI_PLACES=268, PETRI_TRANSITIONS=262} [2025-01-09 21:23:15,254 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -11 predicate places. [2025-01-09 21:23:15,255 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 262 transitions, 531 flow [2025-01-09 21:23:15,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:23:15,255 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:15,256 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:15,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:23:15,256 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:15,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:15,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1215126668, now seen corresponding path program 1 times [2025-01-09 21:23:15,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:15,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210509381] [2025-01-09 21:23:15,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:15,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:15,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:23:15,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:23:15,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:15,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:15,318 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:23:15,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:15,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210509381] [2025-01-09 21:23:15,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210509381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:15,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:15,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:15,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376973717] [2025-01-09 21:23:15,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:15,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:15,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:15,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:15,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:15,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 276 [2025-01-09 21:23:15,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 262 transitions, 531 flow. Second operand has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:23:15,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:15,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 276 [2025-01-09 21:23:15,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:15,390 INFO L124 PetriNetUnfolderBase]: 36/734 cut-off events. [2025-01-09 21:23:15,391 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:15,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 734 events. 36/734 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2925 event pairs, 36 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 774. Up to 89 conditions per place. [2025-01-09 21:23:15,393 INFO L140 encePairwiseOnDemand]: 271/276 looper letters, 17 selfloop transitions, 1 changer transitions 0/258 dead transitions. [2025-01-09 21:23:15,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 258 transitions, 559 flow [2025-01-09 21:23:15,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:15,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:15,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 784 transitions. [2025-01-09 21:23:15,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9468599033816425 [2025-01-09 21:23:15,396 INFO L175 Difference]: Start difference. First operand has 268 places, 262 transitions, 531 flow. Second operand 3 states and 784 transitions. [2025-01-09 21:23:15,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 258 transitions, 559 flow [2025-01-09 21:23:15,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 258 transitions, 555 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:15,399 INFO L231 Difference]: Finished difference. Result has 264 places, 258 transitions, 521 flow [2025-01-09 21:23:15,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=257, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=521, PETRI_PLACES=264, PETRI_TRANSITIONS=258} [2025-01-09 21:23:15,399 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -15 predicate places. [2025-01-09 21:23:15,400 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 258 transitions, 521 flow [2025-01-09 21:23:15,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 255.0) internal successors, (765), 3 states have internal predecessors, (765), 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:23:15,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:15,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:15,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:23:15,400 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:15,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:15,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1203165847, now seen corresponding path program 1 times [2025-01-09 21:23:15,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:15,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720766443] [2025-01-09 21:23:15,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:15,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:15,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 21:23:15,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 21:23:15,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:15,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:15,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:15,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:15,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720766443] [2025-01-09 21:23:15,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720766443] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:15,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:15,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:15,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451418612] [2025-01-09 21:23:15,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:15,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:15,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:15,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:15,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:16,044 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 276 [2025-01-09 21:23:16,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 258 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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:23:16,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:16,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 276 [2025-01-09 21:23:16,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:16,400 INFO L124 PetriNetUnfolderBase]: 638/2428 cut-off events. [2025-01-09 21:23:16,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:16,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3801 conditions, 2428 events. 638/2428 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15408 event pairs, 638 based on Foata normal form. 0/2281 useless extension candidates. Maximal degree in co-relation 3733. Up to 1362 conditions per place. [2025-01-09 21:23:16,407 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 85 selfloop transitions, 5 changer transitions 0/257 dead transitions. [2025-01-09 21:23:16,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 257 transitions, 699 flow [2025-01-09 21:23:16,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:16,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1201 transitions. [2025-01-09 21:23:16,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7252415458937198 [2025-01-09 21:23:16,410 INFO L175 Difference]: Start difference. First operand has 264 places, 258 transitions, 521 flow. Second operand 6 states and 1201 transitions. [2025-01-09 21:23:16,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 257 transitions, 699 flow [2025-01-09 21:23:16,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 257 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:16,413 INFO L231 Difference]: Finished difference. Result has 267 places, 257 transitions, 528 flow [2025-01-09 21:23:16,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=518, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=257, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=528, PETRI_PLACES=267, PETRI_TRANSITIONS=257} [2025-01-09 21:23:16,414 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -12 predicate places. [2025-01-09 21:23:16,414 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 257 transitions, 528 flow [2025-01-09 21:23:16,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.16666666666666) internal successors, (1147), 6 states have internal predecessors, (1147), 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:23:16,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:16,414 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:16,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:23:16,415 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:16,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:16,415 INFO L85 PathProgramCache]: Analyzing trace with hash -2046601516, now seen corresponding path program 1 times [2025-01-09 21:23:16,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:16,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199269213] [2025-01-09 21:23:16,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:16,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:16,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:23:16,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:23:16,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:16,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:16,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:16,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199269213] [2025-01-09 21:23:16,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199269213] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:16,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:16,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630687269] [2025-01-09 21:23:16,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:16,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:16,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:16,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:16,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:17,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-01-09 21:23:17,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 257 transitions, 528 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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:23:17,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:17,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-01-09 21:23:17,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:17,481 INFO L124 PetriNetUnfolderBase]: 232/1787 cut-off events. [2025-01-09 21:23:17,482 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:17,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2345 conditions, 1787 events. 232/1787 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11375 event pairs, 20 based on Foata normal form. 0/1663 useless extension candidates. Maximal degree in co-relation 2277. Up to 305 conditions per place. [2025-01-09 21:23:17,488 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 100 selfloop transitions, 38 changer transitions 0/331 dead transitions. [2025-01-09 21:23:17,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 331 transitions, 952 flow [2025-01-09 21:23:17,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:17,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:17,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1412 transitions. [2025-01-09 21:23:17,491 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526570048309179 [2025-01-09 21:23:17,491 INFO L175 Difference]: Start difference. First operand has 267 places, 257 transitions, 528 flow. Second operand 6 states and 1412 transitions. [2025-01-09 21:23:17,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 331 transitions, 952 flow [2025-01-09 21:23:17,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 331 transitions, 942 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:17,497 INFO L231 Difference]: Finished difference. Result has 271 places, 293 transitions, 776 flow [2025-01-09 21:23:17,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=516, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=256, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=271, PETRI_TRANSITIONS=293} [2025-01-09 21:23:17,498 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -8 predicate places. [2025-01-09 21:23:17,498 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 293 transitions, 776 flow [2025-01-09 21:23:17,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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:23:17,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:17,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:17,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:17,499 INFO L85 PathProgramCache]: Analyzing trace with hash 893767704, now seen corresponding path program 1 times [2025-01-09 21:23:17,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:17,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505839300] [2025-01-09 21:23:17,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:17,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:17,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 21:23:17,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 21:23:17,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:17,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:17,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505839300] [2025-01-09 21:23:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505839300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:17,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:17,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:17,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742193042] [2025-01-09 21:23:17,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:17,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:17,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:17,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:17,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:18,193 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-01-09 21:23:18,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 293 transitions, 776 flow. Second operand has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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:23:18,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:18,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-01-09 21:23:18,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:18,403 INFO L124 PetriNetUnfolderBase]: 185/1591 cut-off events. [2025-01-09 21:23:18,403 INFO L125 PetriNetUnfolderBase]: For 206/211 co-relation queries the response was YES. [2025-01-09 21:23:18,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2363 conditions, 1591 events. 185/1591 cut-off events. For 206/211 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9959 event pairs, 75 based on Foata normal form. 0/1471 useless extension candidates. Maximal degree in co-relation 2293. Up to 354 conditions per place. [2025-01-09 21:23:18,409 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 96 selfloop transitions, 5 changer transitions 0/308 dead transitions. [2025-01-09 21:23:18,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 308 transitions, 1008 flow [2025-01-09 21:23:18,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-01-09 21:23:18,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-01-09 21:23:18,412 INFO L175 Difference]: Start difference. First operand has 271 places, 293 transitions, 776 flow. Second operand 6 states and 1382 transitions. [2025-01-09 21:23:18,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 308 transitions, 1008 flow [2025-01-09 21:23:18,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 308 transitions, 1008 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:18,419 INFO L231 Difference]: Finished difference. Result has 275 places, 292 transitions, 784 flow [2025-01-09 21:23:18,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=275, PETRI_TRANSITIONS=292} [2025-01-09 21:23:18,420 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, -4 predicate places. [2025-01-09 21:23:18,420 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 292 transitions, 784 flow [2025-01-09 21:23:18,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.66666666666666) internal successors, (1348), 6 states have internal predecessors, (1348), 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:23:18,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:18,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:18,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:18,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:18,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:18,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1777114751, now seen corresponding path program 1 times [2025-01-09 21:23:18,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:18,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719344115] [2025-01-09 21:23:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:18,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:18,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:23:18,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:23:18,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:18,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:18,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:18,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719344115] [2025-01-09 21:23:18,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719344115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:18,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:18,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:18,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882564662] [2025-01-09 21:23:18,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:18,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:18,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:18,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:19,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 276 [2025-01-09 21:23:19,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 292 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:23:19,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:19,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 276 [2025-01-09 21:23:19,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:19,435 INFO L124 PetriNetUnfolderBase]: 583/2948 cut-off events. [2025-01-09 21:23:19,435 INFO L125 PetriNetUnfolderBase]: For 706/713 co-relation queries the response was YES. [2025-01-09 21:23:19,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5026 conditions, 2948 events. 583/2948 cut-off events. For 706/713 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21807 event pairs, 69 based on Foata normal form. 0/2761 useless extension candidates. Maximal degree in co-relation 4953. Up to 795 conditions per place. [2025-01-09 21:23:19,447 INFO L140 encePairwiseOnDemand]: 254/276 looper letters, 111 selfloop transitions, 72 changer transitions 0/381 dead transitions. [2025-01-09 21:23:19,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 280 places, 381 transitions, 1520 flow [2025-01-09 21:23:19,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:19,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:19,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1389 transitions. [2025-01-09 21:23:19,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8387681159420289 [2025-01-09 21:23:19,450 INFO L175 Difference]: Start difference. First operand has 275 places, 292 transitions, 784 flow. Second operand 6 states and 1389 transitions. [2025-01-09 21:23:19,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 280 places, 381 transitions, 1520 flow [2025-01-09 21:23:19,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 381 transitions, 1502 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:19,458 INFO L231 Difference]: Finished difference. Result has 280 places, 362 transitions, 1440 flow [2025-01-09 21:23:19,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=280, PETRI_TRANSITIONS=362} [2025-01-09 21:23:19,460 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 1 predicate places. [2025-01-09 21:23:19,460 INFO L471 AbstractCegarLoop]: Abstraction has has 280 places, 362 transitions, 1440 flow [2025-01-09 21:23:19,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 217.0) internal successors, (1302), 6 states have internal predecessors, (1302), 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:23:19,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:19,460 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:19,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:19,461 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:19,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:19,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1489313437, now seen corresponding path program 1 times [2025-01-09 21:23:19,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:19,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803890286] [2025-01-09 21:23:19,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:19,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:19,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:23:19,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:23:19,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:19,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:19,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:19,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:19,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803890286] [2025-01-09 21:23:19,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803890286] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:19,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:19,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:19,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860331182] [2025-01-09 21:23:19,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:19,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:19,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:19,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:19,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:19,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-01-09 21:23:19,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 280 places, 362 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:23:19,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-01-09 21:23:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:20,670 INFO L124 PetriNetUnfolderBase]: 1657/5695 cut-off events. [2025-01-09 21:23:20,670 INFO L125 PetriNetUnfolderBase]: For 3355/3415 co-relation queries the response was YES. [2025-01-09 21:23:20,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12784 conditions, 5695 events. 1657/5695 cut-off events. For 3355/3415 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 45929 event pairs, 861 based on Foata normal form. 0/5366 useless extension candidates. Maximal degree in co-relation 12709. Up to 3147 conditions per place. [2025-01-09 21:23:20,694 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 201 selfloop transitions, 89 changer transitions 0/462 dead transitions. [2025-01-09 21:23:20,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 462 transitions, 2424 flow [2025-01-09 21:23:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:20,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-01-09 21:23:20,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-01-09 21:23:20,697 INFO L175 Difference]: Start difference. First operand has 280 places, 362 transitions, 1440 flow. Second operand 6 states and 1302 transitions. [2025-01-09 21:23:20,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 462 transitions, 2424 flow [2025-01-09 21:23:20,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 462 transitions, 2424 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:20,710 INFO L231 Difference]: Finished difference. Result has 290 places, 446 transitions, 2242 flow [2025-01-09 21:23:20,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=290, PETRI_TRANSITIONS=446} [2025-01-09 21:23:20,711 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 11 predicate places. [2025-01-09 21:23:20,711 INFO L471 AbstractCegarLoop]: Abstraction has has 290 places, 446 transitions, 2242 flow [2025-01-09 21:23:20,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 196.33333333333334) internal successors, (1178), 6 states have internal predecessors, (1178), 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:23:20,712 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:20,712 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:20,712 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:20,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:20,713 INFO L85 PathProgramCache]: Analyzing trace with hash 106924031, now seen corresponding path program 1 times [2025-01-09 21:23:20,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:20,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065028916] [2025-01-09 21:23:20,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:20,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:20,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:23:20,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:23:20,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:20,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:20,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:20,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065028916] [2025-01-09 21:23:20,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065028916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:20,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:20,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:23:20,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887900634] [2025-01-09 21:23:20,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:20,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:20,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:20,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:20,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:20,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 276 [2025-01-09 21:23:20,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 290 places, 446 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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:23:20,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:20,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 276 [2025-01-09 21:23:20,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:21,037 INFO L124 PetriNetUnfolderBase]: 315/1970 cut-off events. [2025-01-09 21:23:21,037 INFO L125 PetriNetUnfolderBase]: For 1136/1199 co-relation queries the response was YES. [2025-01-09 21:23:21,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4120 conditions, 1970 events. 315/1970 cut-off events. For 1136/1199 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13471 event pairs, 31 based on Foata normal form. 4/1894 useless extension candidates. Maximal degree in co-relation 4047. Up to 312 conditions per place. [2025-01-09 21:23:21,047 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 10 selfloop transitions, 6 changer transitions 0/386 dead transitions. [2025-01-09 21:23:21,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 292 places, 386 transitions, 1710 flow [2025-01-09 21:23:21,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:21,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:21,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 816 transitions. [2025-01-09 21:23:21,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9855072463768116 [2025-01-09 21:23:21,050 INFO L175 Difference]: Start difference. First operand has 290 places, 446 transitions, 2242 flow. Second operand 3 states and 816 transitions. [2025-01-09 21:23:21,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 292 places, 386 transitions, 1710 flow [2025-01-09 21:23:21,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 386 transitions, 1622 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:21,065 INFO L231 Difference]: Finished difference. Result has 293 places, 384 transitions, 1612 flow [2025-01-09 21:23:21,066 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=380, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=374, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1612, PETRI_PLACES=293, PETRI_TRANSITIONS=384} [2025-01-09 21:23:21,067 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 14 predicate places. [2025-01-09 21:23:21,067 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 384 transitions, 1612 flow [2025-01-09 21:23:21,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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:23:21,067 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:21,067 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:21,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:23:21,068 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 735522291, now seen corresponding path program 1 times [2025-01-09 21:23:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:21,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695009057] [2025-01-09 21:23:21,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:21,094 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 21:23:21,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 21:23:21,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:21,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:21,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:23:21,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:21,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695009057] [2025-01-09 21:23:21,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695009057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:21,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:21,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:21,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139188823] [2025-01-09 21:23:21,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:21,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:21,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:21,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:21,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 276 [2025-01-09 21:23:21,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 384 transitions, 1612 flow. Second operand has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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:23:21,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:21,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 276 [2025-01-09 21:23:21,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:22,116 INFO L124 PetriNetUnfolderBase]: 690/3113 cut-off events. [2025-01-09 21:23:22,116 INFO L125 PetriNetUnfolderBase]: For 3020/3221 co-relation queries the response was YES. [2025-01-09 21:23:22,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7440 conditions, 3113 events. 690/3113 cut-off events. For 3020/3221 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23921 event pairs, 54 based on Foata normal form. 20/3022 useless extension candidates. Maximal degree in co-relation 7357. Up to 734 conditions per place. [2025-01-09 21:23:22,128 INFO L140 encePairwiseOnDemand]: 257/276 looper letters, 184 selfloop transitions, 124 changer transitions 4/542 dead transitions. [2025-01-09 21:23:22,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 297 places, 542 transitions, 3203 flow [2025-01-09 21:23:22,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:22,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1430 transitions. [2025-01-09 21:23:22,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8635265700483091 [2025-01-09 21:23:22,134 INFO L175 Difference]: Start difference. First operand has 293 places, 384 transitions, 1612 flow. Second operand 6 states and 1430 transitions. [2025-01-09 21:23:22,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 297 places, 542 transitions, 3203 flow [2025-01-09 21:23:22,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 296 places, 542 transitions, 3180 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:22,147 INFO L231 Difference]: Finished difference. Result has 301 places, 486 transitions, 2988 flow [2025-01-09 21:23:22,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=1604, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=383, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2988, PETRI_PLACES=301, PETRI_TRANSITIONS=486} [2025-01-09 21:23:22,148 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 22 predicate places. [2025-01-09 21:23:22,148 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 486 transitions, 2988 flow [2025-01-09 21:23:22,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.33333333333334) internal successors, (1316), 6 states have internal predecessors, (1316), 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:23:22,148 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:22,148 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:22,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:23:22,148 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:22,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:22,149 INFO L85 PathProgramCache]: Analyzing trace with hash 347820555, now seen corresponding path program 1 times [2025-01-09 21:23:22,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:22,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216236984] [2025-01-09 21:23:22,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:22,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:23:22,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:23:22,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:22,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:22,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:22,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216236984] [2025-01-09 21:23:22,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216236984] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:22,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:22,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:22,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108375685] [2025-01-09 21:23:22,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:22,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:22,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:22,484 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:22,484 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:22,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 276 [2025-01-09 21:23:22,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 486 transitions, 2988 flow. Second operand has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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:23:22,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:22,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 276 [2025-01-09 21:23:22,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:23,233 INFO L124 PetriNetUnfolderBase]: 605/2890 cut-off events. [2025-01-09 21:23:23,233 INFO L125 PetriNetUnfolderBase]: For 5479/5694 co-relation queries the response was YES. [2025-01-09 21:23:23,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7823 conditions, 2890 events. 605/2890 cut-off events. For 5479/5694 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21929 event pairs, 92 based on Foata normal form. 18/2852 useless extension candidates. Maximal degree in co-relation 7737. Up to 803 conditions per place. [2025-01-09 21:23:23,246 INFO L140 encePairwiseOnDemand]: 270/276 looper letters, 218 selfloop transitions, 17 changer transitions 0/501 dead transitions. [2025-01-09 21:23:23,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 501 transitions, 3512 flow [2025-01-09 21:23:23,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:23,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1382 transitions. [2025-01-09 21:23:23,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8345410628019324 [2025-01-09 21:23:23,249 INFO L175 Difference]: Start difference. First operand has 301 places, 486 transitions, 2988 flow. Second operand 6 states and 1382 transitions. [2025-01-09 21:23:23,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 501 transitions, 3512 flow [2025-01-09 21:23:23,263 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 501 transitions, 3494 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:23,269 INFO L231 Difference]: Finished difference. Result has 305 places, 485 transitions, 3002 flow [2025-01-09 21:23:23,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3002, PETRI_PLACES=305, PETRI_TRANSITIONS=485} [2025-01-09 21:23:23,271 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 26 predicate places. [2025-01-09 21:23:23,271 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 485 transitions, 3002 flow [2025-01-09 21:23:23,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.66666666666666) internal successors, (1354), 6 states have internal predecessors, (1354), 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:23:23,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:23,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:23:23,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash 982429328, now seen corresponding path program 1 times [2025-01-09 21:23:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:23,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784712598] [2025-01-09 21:23:23,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:23,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:23,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 21:23:23,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 21:23:23,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:23,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:23,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:23,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:23,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784712598] [2025-01-09 21:23:23,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784712598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:23,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:23,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:23,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960502798] [2025-01-09 21:23:23,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:23,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:23,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:23,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:23,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:23,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 276 [2025-01-09 21:23:23,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 485 transitions, 3002 flow. Second operand has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:23:23,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:23,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 276 [2025-01-09 21:23:23,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:24,569 INFO L124 PetriNetUnfolderBase]: 1547/5161 cut-off events. [2025-01-09 21:23:24,570 INFO L125 PetriNetUnfolderBase]: For 7543/7624 co-relation queries the response was YES. [2025-01-09 21:23:24,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15138 conditions, 5161 events. 1547/5161 cut-off events. For 7543/7624 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41358 event pairs, 582 based on Foata normal form. 1/5009 useless extension candidates. Maximal degree in co-relation 15051. Up to 2881 conditions per place. [2025-01-09 21:23:24,590 INFO L140 encePairwiseOnDemand]: 253/276 looper letters, 304 selfloop transitions, 103 changer transitions 8/591 dead transitions. [2025-01-09 21:23:24,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 591 transitions, 4442 flow [2025-01-09 21:23:24,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1302 transitions. [2025-01-09 21:23:24,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7862318840579711 [2025-01-09 21:23:24,592 INFO L175 Difference]: Start difference. First operand has 305 places, 485 transitions, 3002 flow. Second operand 6 states and 1302 transitions. [2025-01-09 21:23:24,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 591 transitions, 4442 flow [2025-01-09 21:23:24,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 591 transitions, 4408 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:24,616 INFO L231 Difference]: Finished difference. Result has 310 places, 571 transitions, 3986 flow [2025-01-09 21:23:24,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=2968, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=485, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3986, PETRI_PLACES=310, PETRI_TRANSITIONS=571} [2025-01-09 21:23:24,617 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 31 predicate places. [2025-01-09 21:23:24,617 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 571 transitions, 3986 flow [2025-01-09 21:23:24,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 198.66666666666666) internal successors, (1192), 6 states have internal predecessors, (1192), 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:23:24,618 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:24,618 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:23:24,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:24,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 828551593, now seen corresponding path program 1 times [2025-01-09 21:23:24,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:24,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820628318] [2025-01-09 21:23:24,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:24,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:24,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:23:24,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:24,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:24,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:26,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:26,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820628318] [2025-01-09 21:23:26,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820628318] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:26,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:26,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 21:23:26,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10023659] [2025-01-09 21:23:26,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:26,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:23:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:26,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:23:26,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:23:28,246 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 276 [2025-01-09 21:23:28,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 571 transitions, 3986 flow. Second operand has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 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:23:28,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:28,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 276 [2025-01-09 21:23:28,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:29,873 INFO L124 PetriNetUnfolderBase]: 1717/5670 cut-off events. [2025-01-09 21:23:29,874 INFO L125 PetriNetUnfolderBase]: For 11266/11335 co-relation queries the response was YES. [2025-01-09 21:23:29,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18569 conditions, 5670 events. 1717/5670 cut-off events. For 11266/11335 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 46232 event pairs, 195 based on Foata normal form. 19/5643 useless extension candidates. Maximal degree in co-relation 18462. Up to 1900 conditions per place. [2025-01-09 21:23:29,896 INFO L140 encePairwiseOnDemand]: 245/276 looper letters, 529 selfloop transitions, 101 changer transitions 23/785 dead transitions. [2025-01-09 21:23:29,897 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 785 transitions, 6962 flow [2025-01-09 21:23:29,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-01-09 21:23:29,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2025-01-09 21:23:29,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 4364 transitions. [2025-01-09 21:23:29,902 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5646997929606625 [2025-01-09 21:23:29,902 INFO L175 Difference]: Start difference. First operand has 310 places, 571 transitions, 3986 flow. Second operand 28 states and 4364 transitions. [2025-01-09 21:23:29,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 785 transitions, 6962 flow [2025-01-09 21:23:29,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 785 transitions, 6758 flow, removed 102 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:29,947 INFO L231 Difference]: Finished difference. Result has 347 places, 604 transitions, 4436 flow [2025-01-09 21:23:29,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=3838, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=69, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=28, PETRI_FLOW=4436, PETRI_PLACES=347, PETRI_TRANSITIONS=604} [2025-01-09 21:23:29,948 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 68 predicate places. [2025-01-09 21:23:29,948 INFO L471 AbstractCegarLoop]: Abstraction has has 347 places, 604 transitions, 4436 flow [2025-01-09 21:23:29,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 151.15) internal successors, (3023), 20 states have internal predecessors, (3023), 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:23:29,949 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:29,949 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:29,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:23:29,949 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1784194913, now seen corresponding path program 1 times [2025-01-09 21:23:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432001737] [2025-01-09 21:23:29,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:29,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:29,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:23:29,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:29,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:29,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:30,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:30,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:30,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432001737] [2025-01-09 21:23:30,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432001737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:30,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:30,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2025-01-09 21:23:30,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136097235] [2025-01-09 21:23:30,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:30,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:23:30,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:30,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:23:30,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:23:33,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 276 [2025-01-09 21:23:33,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 604 transitions, 4436 flow. Second operand has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 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:23:33,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:33,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 276 [2025-01-09 21:23:33,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:34,247 INFO L124 PetriNetUnfolderBase]: 1405/5296 cut-off events. [2025-01-09 21:23:34,247 INFO L125 PetriNetUnfolderBase]: For 13203/13390 co-relation queries the response was YES. [2025-01-09 21:23:34,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17949 conditions, 5296 events. 1405/5296 cut-off events. For 13203/13390 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 45108 event pairs, 151 based on Foata normal form. 27/5269 useless extension candidates. Maximal degree in co-relation 17825. Up to 1437 conditions per place. [2025-01-09 21:23:34,275 INFO L140 encePairwiseOnDemand]: 243/276 looper letters, 400 selfloop transitions, 123 changer transitions 8/777 dead transitions. [2025-01-09 21:23:34,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 777 transitions, 7003 flow [2025-01-09 21:23:34,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-01-09 21:23:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-01-09 21:23:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4148 transitions. [2025-01-09 21:23:34,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6534341524889729 [2025-01-09 21:23:34,277 INFO L175 Difference]: Start difference. First operand has 347 places, 604 transitions, 4436 flow. Second operand 23 states and 4148 transitions. [2025-01-09 21:23:34,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 777 transitions, 7003 flow [2025-01-09 21:23:34,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 777 transitions, 6879 flow, removed 51 selfloop flow, removed 10 redundant places. [2025-01-09 21:23:34,331 INFO L231 Difference]: Finished difference. Result has 367 places, 668 transitions, 5598 flow [2025-01-09 21:23:34,332 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=4354, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5598, PETRI_PLACES=367, PETRI_TRANSITIONS=668} [2025-01-09 21:23:34,332 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 88 predicate places. [2025-01-09 21:23:34,332 INFO L471 AbstractCegarLoop]: Abstraction has has 367 places, 668 transitions, 5598 flow [2025-01-09 21:23:34,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 176.66666666666666) internal successors, (3180), 18 states have internal predecessors, (3180), 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:23:34,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:34,333 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:34,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:23:34,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:34,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:34,334 INFO L85 PathProgramCache]: Analyzing trace with hash -93022475, now seen corresponding path program 2 times [2025-01-09 21:23:34,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:34,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32113666] [2025-01-09 21:23:34,334 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:34,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:34,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 188 statements into 2 equivalence classes. [2025-01-09 21:23:34,386 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:34,386 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:23:34,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:35,270 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:35,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:35,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32113666] [2025-01-09 21:23:35,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32113666] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:35,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:35,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 21:23:35,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229788225] [2025-01-09 21:23:35,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:35,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 21:23:35,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:35,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 21:23:35,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2025-01-09 21:23:37,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 276 [2025-01-09 21:23:37,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 367 places, 668 transitions, 5598 flow. Second operand has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 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:23:37,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:37,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 276 [2025-01-09 21:23:37,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:39,226 INFO L124 PetriNetUnfolderBase]: 1484/5521 cut-off events. [2025-01-09 21:23:39,226 INFO L125 PetriNetUnfolderBase]: For 18014/18258 co-relation queries the response was YES. [2025-01-09 21:23:39,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19886 conditions, 5521 events. 1484/5521 cut-off events. For 18014/18258 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 47026 event pairs, 151 based on Foata normal form. 76/5541 useless extension candidates. Maximal degree in co-relation 19752. Up to 802 conditions per place. [2025-01-09 21:23:39,257 INFO L140 encePairwiseOnDemand]: 244/276 looper letters, 475 selfloop transitions, 171 changer transitions 9/897 dead transitions. [2025-01-09 21:23:39,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 400 places, 897 transitions, 8829 flow [2025-01-09 21:23:39,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-01-09 21:23:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-01-09 21:23:39,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6028 transitions. [2025-01-09 21:23:39,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6423699914748509 [2025-01-09 21:23:39,260 INFO L175 Difference]: Start difference. First operand has 367 places, 668 transitions, 5598 flow. Second operand 34 states and 6028 transitions. [2025-01-09 21:23:39,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 400 places, 897 transitions, 8829 flow [2025-01-09 21:23:39,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 897 transitions, 8743 flow, removed 23 selfloop flow, removed 11 redundant places. [2025-01-09 21:23:39,336 INFO L231 Difference]: Finished difference. Result has 402 places, 734 transitions, 6802 flow [2025-01-09 21:23:39,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=276, PETRI_DIFFERENCE_MINUEND_FLOW=5548, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=109, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=6802, PETRI_PLACES=402, PETRI_TRANSITIONS=734} [2025-01-09 21:23:39,337 INFO L279 CegarLoopForPetriNet]: 279 programPoint places, 123 predicate places. [2025-01-09 21:23:39,337 INFO L471 AbstractCegarLoop]: Abstraction has has 402 places, 734 transitions, 6802 flow [2025-01-09 21:23:39,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 174.35) internal successors, (3487), 20 states have internal predecessors, (3487), 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:23:39,338 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:39,338 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:23:39,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:23:39,338 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-01-09 21:23:39,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:39,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1174966991, now seen corresponding path program 3 times [2025-01-09 21:23:39,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:39,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057822066] [2025-01-09 21:23:39,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:39,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:39,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 2 equivalence classes. [2025-01-09 21:23:39,441 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:39,441 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 21:23:39,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:23:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057822066] [2025-01-09 21:23:40,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057822066] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:40,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1712349814] [2025-01-09 21:23:40,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:40,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:40,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:40,508 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:23:40,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:23:40,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 188 statements into 2 equivalence classes. [2025-01-09 21:23:41,548 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:23:41,549 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 21:23:41,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:41,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 702 conjuncts, 101 conjuncts are in the unsatisfiable core [2025-01-09 21:23:41,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:41,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-01-09 21:23:41,669 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:23:41,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-01-09 21:23:41,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:41,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:42,132 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:42,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 21:23:42,156 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:42,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-01-09 21:23:42,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-01-09 21:23:42,336 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:42,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-01-09 21:23:42,353 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:42,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 19 [2025-01-09 21:23:42,543 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 21:23:42,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-01-09 21:23:42,560 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2025-01-09 21:23:42,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 23 [2025-01-09 21:23:43,061 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:43,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-01-09 21:23:43,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-01-09 21:23:43,259 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 21:23:43,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 7 [2025-01-09 21:23:43,268 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-01-09 21:23:43,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2025-01-09 21:23:43,313 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:43,313 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2025-01-09 21:23:43,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2025-01-09 21:23:43,430 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:43,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2025-01-09 21:23:43,487 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-01-09 21:23:43,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2025-01-09 21:23:43,511 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-01-09 21:23:43,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 45 treesize of output 57 [2025-01-09 21:23:43,702 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 21:23:43,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 111 treesize of output 104 [2025-01-09 21:23:43,743 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 21:23:43,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 107 treesize of output 111 [2025-01-09 21:23:43,852 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 21:23:43,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2025-01-09 21:23:43,914 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 21:23:43,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2025-01-09 21:23:44,092 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-01-09 21:23:44,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 15 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 118 treesize of output 114 [2025-01-09 21:23:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:23:44,189 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:45,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:45,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 178 treesize of output 158 [2025-01-09 21:23:45,537 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (+ 7 c_~B~0.offset))) (let ((.cse0 (+ c_~A~0.offset 7)) (.cse1 (+ c_~A~0.offset 4)) (.cse2 (+ c_~A~0.offset 5)) (.cse4 (+ |c_t_funThread1of1ForFork0_#t~mem33.offset| 3)) (.cse5 (store |c_#race| c_~B~0.base (store (select |c_#race| c_~B~0.base) .cse9 0))) (.cse6 (+ c_~A~0.offset 6))) (and (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((|t_funThread1of1ForFork0_#t~nondet36| Int) (v_ArrVal_2559 Int)) (= (select (select (let ((.cse3 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse3 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_ArrVal_2559) |c_t_funThread1of1ForFork0_#t~mem33.offset| |t_funThread1of1ForFork0_#t~nondet36|))) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_2 Int) (v_prenex_1 Int)) (= 0 (select (select (let ((.cse7 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse7 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse7 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_2) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_1))) c_~B~0.base) (+ 4 c_~B~0.offset)))) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_4 Int) (v_prenex_3 Int)) (= (select (select (let ((.cse8 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse8 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse8 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_4) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_3))) c_~B~0.base) .cse9) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int))) (or (not (= (select v_arrayElimArr_1 .cse0) 0)) (not (= (select v_arrayElimArr_1 .cse1) 0)) (not (= (select v_arrayElimArr_1 .cse2) 0)) (forall ((v_prenex_6 Int) (v_prenex_5 Int)) (= (select (select (let ((.cse10 (store .cse5 c_~A~0.base v_arrayElimArr_1))) (store .cse10 |c_t_funThread1of1ForFork0_#t~mem33.base| (store (store (select .cse10 |c_t_funThread1of1ForFork0_#t~mem33.base|) .cse4 v_prenex_6) |c_t_funThread1of1ForFork0_#t~mem33.offset| v_prenex_5))) c_~B~0.base) (+ 6 c_~B~0.offset)) 0)) (not (= (select v_arrayElimArr_1 .cse6) 0))))))) is different from false [2025-01-09 21:23:47,954 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2025-01-09 21:23:47,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 730 treesize of output 652 [2025-01-09 21:23:47,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:47,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 418 [2025-01-09 21:23:47,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 243 [2025-01-09 21:23:48,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 438 treesize of output 444 [2025-01-09 21:23:48,238 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2025-01-09 21:23:48,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 935 treesize of output 797 [2025-01-09 21:23:48,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 422 treesize of output 418 [2025-01-09 21:23:48,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 243 [2025-01-09 21:23:48,364 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 438 treesize of output 444 [2025-01-09 21:23:48,578 INFO L349 Elim1Store]: treesize reduction 37, result has 61.5 percent of original size [2025-01-09 21:23:48,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 598 treesize of output 600 [2025-01-09 21:23:48,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 303 treesize of output 303 [2025-01-09 21:23:48,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,629 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 662 treesize of output 660 [2025-01-09 21:23:48,658 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 21:23:48,791 INFO L349 Elim1Store]: treesize reduction 70, result has 27.1 percent of original size [2025-01-09 21:23:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1020 treesize of output 869 [2025-01-09 21:23:48,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 389 [2025-01-09 21:23:48,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 367 treesize of output 359 [2025-01-09 21:23:48,853 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:48,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 436 treesize of output 442 [2025-01-09 21:23:56,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-01-09 21:23:56,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-01-09 21:23:56,512 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-01-09 21:23:56,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,584 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2025-01-09 21:23:56,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:23:56,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:56,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2025-01-09 21:24:04,490 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 21:24:04,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1712349814] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:04,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:04,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 25, 22] total 59 [2025-01-09 21:24:04,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116178089] [2025-01-09 21:24:04,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:04,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-01-09 21:24:04,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:04,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-01-09 21:24:04,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=3077, Unknown=74, NotChecked=114, Total=3540 [2025-01-09 21:24:13,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 276 [2025-01-09 21:24:13,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 402 places, 734 transitions, 6802 flow. Second operand has 60 states, 60 states have (on average 112.3) internal successors, (6738), 60 states have internal predecessors, (6738), 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:24:13,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:13,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 276 [2025-01-09 21:24:13,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand