./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.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_02-list_nr.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 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:56,836 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:56,906 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:22:56,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:56,911 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:56,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:56,941 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:56,942 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:56,942 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:56,943 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:56,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:56,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:56,944 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:56,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:56,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:56,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:56,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:56,947 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:56,947 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:56,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:56,947 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 -> 68b918b5051efa1a4363a7cd528e42e31cd4f687fef5116849d37b2131e9c46c [2025-01-09 21:22:57,247 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:57,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:57,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:57,261 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:57,261 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:57,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-09 21:22:58,611 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/180bec11d/071ab59db00c45c2b8f9b6ee9f212571/FLAG5607cb6ee [2025-01-09 21:22:59,018 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:59,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_02-list_nr.i [2025-01-09 21:22:59,033 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/180bec11d/071ab59db00c45c2b8f9b6ee9f212571/FLAG5607cb6ee [2025-01-09 21:22:59,045 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/180bec11d/071ab59db00c45c2b8f9b6ee9f212571 [2025-01-09 21:22:59,047 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:59,048 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:59,049 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:59,049 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:59,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:59,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74465230 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59, skipping insertion in model container [2025-01-09 21:22:59,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,091 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:59,568 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:59,589 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:59,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:59,728 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:59,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59 WrapperNode [2025-01-09 21:22:59,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:59,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:59,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:59,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:59,737 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:22:59" (1/1) ... [2025-01-09 21:22:59,751 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:22:59" (1/1) ... [2025-01-09 21:22:59,776 INFO L138 Inliner]: procedures = 368, calls = 27, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 221 [2025-01-09 21:22:59,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:59,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:59,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:59,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:59,784 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,784 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,807 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,818 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,819 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,822 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:59,823 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:59,823 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:59,823 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:59,824 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (1/1) ... [2025-01-09 21:22:59,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:59,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:59,850 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:22:59,853 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:22:59,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:22:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:59,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:59,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:59,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:59,874 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:00,001 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:23:00,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:23:00,420 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:23:00,420 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:23:00,448 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:23:00,450 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:23:00,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:00 BoogieIcfgContainer [2025-01-09 21:23:00,450 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:23:00,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:23:00,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:23:00,457 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:23:00,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:59" (1/3) ... [2025-01-09 21:23:00,458 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5381b12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:00, skipping insertion in model container [2025-01-09 21:23:00,458 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:59" (2/3) ... [2025-01-09 21:23:00,459 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5381b12f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:23:00, skipping insertion in model container [2025-01-09 21:23:00,459 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:23:00" (3/3) ... [2025-01-09 21:23:00,460 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_02-list_nr.i [2025-01-09 21:23:00,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:23:00,478 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_02-list_nr.i that has 2 procedures, 250 locations, 1 initial locations, 0 loop locations, and 18 error locations. [2025-01-09 21:23:00,479 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:23:00,580 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:23:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 253 places, 249 transitions, 502 flow [2025-01-09 21:23:00,704 INFO L124 PetriNetUnfolderBase]: 0/248 cut-off events. [2025-01-09 21:23:00,708 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:00,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 248 events. 0/248 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 85 event pairs, 0 based on Foata normal form. 0/230 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-01-09 21:23:00,713 INFO L82 GeneralOperation]: Start removeDead. Operand has 253 places, 249 transitions, 502 flow [2025-01-09 21:23:00,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 248 transitions, 499 flow [2025-01-09 21:23:00,732 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:23:00,745 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;@1dfbf062, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:23:00,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2025-01-09 21:23:00,761 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:23:00,762 INFO L124 PetriNetUnfolderBase]: 0/83 cut-off events. [2025-01-09 21:23:00,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:00,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:00,763 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] [2025-01-09 21:23:00,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:00,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:00,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1044138680, now seen corresponding path program 1 times [2025-01-09 21:23:00,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:00,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387440010] [2025-01-09 21:23:00,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:00,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-01-09 21:23:00,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-01-09 21:23:00,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:00,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:01,800 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:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:01,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387440010] [2025-01-09 21:23:01,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387440010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:01,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:01,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:01,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018146796] [2025-01-09 21:23:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:01,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:01,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:01,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:01,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:02,268 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-01-09 21:23:02,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 248 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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:02,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:02,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-01-09 21:23:02,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:02,659 INFO L124 PetriNetUnfolderBase]: 220/1072 cut-off events. [2025-01-09 21:23:02,659 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:02,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1072 events. 220/1072 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5354 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1398. Up to 488 conditions per place. [2025-01-09 21:23:02,676 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/246 dead transitions. [2025-01-09 21:23:02,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 246 transitions, 609 flow [2025-01-09 21:23:02,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:02,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:02,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-01-09 21:23:02,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-01-09 21:23:02,702 INFO L175 Difference]: Start difference. First operand has 252 places, 248 transitions, 499 flow. Second operand 6 states and 1199 transitions. [2025-01-09 21:23:02,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 246 transitions, 609 flow [2025-01-09 21:23:02,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 254 places, 246 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:02,715 INFO L231 Difference]: Finished difference. Result has 254 places, 246 transitions, 514 flow [2025-01-09 21:23:02,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=249, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=254, PETRI_TRANSITIONS=246} [2025-01-09 21:23:02,722 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 2 predicate places. [2025-01-09 21:23:02,722 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 246 transitions, 514 flow [2025-01-09 21:23:02,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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:02,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:02,724 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:02,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:23:02,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:02,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash -956173680, now seen corresponding path program 1 times [2025-01-09 21:23:02,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:02,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840545605] [2025-01-09 21:23:02,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:02,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 21:23:02,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 21:23:02,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:02,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:03,239 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:03,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:03,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840545605] [2025-01-09 21:23:03,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840545605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:03,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:03,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:03,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075311821] [2025-01-09 21:23:03,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:03,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:03,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:03,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:03,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:03,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 190 out of 249 [2025-01-09 21:23:03,554 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 246 transitions, 514 flow. Second operand has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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:03,554 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:03,554 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 190 of 249 [2025-01-09 21:23:03,554 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:03,813 INFO L124 PetriNetUnfolderBase]: 220/1070 cut-off events. [2025-01-09 21:23:03,813 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:03,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1070 events. 220/1070 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5357 event pairs, 220 based on Foata normal form. 0/967 useless extension candidates. Maximal degree in co-relation 1439. Up to 488 conditions per place. [2025-01-09 21:23:03,820 INFO L140 encePairwiseOnDemand]: 237/249 looper letters, 47 selfloop transitions, 10 changer transitions 0/244 dead transitions. [2025-01-09 21:23:03,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 244 transitions, 624 flow [2025-01-09 21:23:03,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:03,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:03,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1199 transitions. [2025-01-09 21:23:03,826 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8025435073627845 [2025-01-09 21:23:03,826 INFO L175 Difference]: Start difference. First operand has 254 places, 246 transitions, 514 flow. Second operand 6 states and 1199 transitions. [2025-01-09 21:23:03,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 244 transitions, 624 flow [2025-01-09 21:23:03,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 244 transitions, 604 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:03,833 INFO L231 Difference]: Finished difference. Result has 252 places, 244 transitions, 510 flow [2025-01-09 21:23:03,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=247, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=510, PETRI_PLACES=252, PETRI_TRANSITIONS=244} [2025-01-09 21:23:03,837 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 0 predicate places. [2025-01-09 21:23:03,838 INFO L471 AbstractCegarLoop]: Abstraction has has 252 places, 244 transitions, 510 flow [2025-01-09 21:23:03,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 191.33333333333334) internal successors, (1148), 6 states have internal predecessors, (1148), 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:03,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:03,839 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] [2025-01-09 21:23:03,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:23:03,839 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:03,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:03,842 INFO L85 PathProgramCache]: Analyzing trace with hash -130714399, now seen corresponding path program 1 times [2025-01-09 21:23:03,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:03,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566328818] [2025-01-09 21:23:03,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:03,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:03,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 21:23:03,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 21:23:03,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:03,930 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:03,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566328818] [2025-01-09 21:23:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566328818] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:03,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:03,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:03,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772846777] [2025-01-09 21:23:03,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:03,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:03,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:03,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 249 [2025-01-09 21:23:03,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 252 places, 244 transitions, 510 flow. Second operand has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:03,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:03,973 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 249 [2025-01-09 21:23:03,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:04,034 INFO L124 PetriNetUnfolderBase]: 16/379 cut-off events. [2025-01-09 21:23:04,034 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:04,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 379 events. 16/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 756 event pairs, 16 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 298. Up to 47 conditions per place. [2025-01-09 21:23:04,036 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 14 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-01-09 21:23:04,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 243 transitions, 540 flow [2025-01-09 21:23:04,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:04,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:04,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-01-09 21:23:04,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544846050870147 [2025-01-09 21:23:04,039 INFO L175 Difference]: Start difference. First operand has 252 places, 244 transitions, 510 flow. Second operand 3 states and 713 transitions. [2025-01-09 21:23:04,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 243 transitions, 540 flow [2025-01-09 21:23:04,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 248 places, 243 transitions, 520 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:04,044 INFO L231 Difference]: Finished difference. Result has 248 places, 243 transitions, 492 flow [2025-01-09 21:23:04,044 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=243, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=241, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=248, PETRI_TRANSITIONS=243} [2025-01-09 21:23:04,045 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -4 predicate places. [2025-01-09 21:23:04,045 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 243 transitions, 492 flow [2025-01-09 21:23:04,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 233.33333333333334) internal successors, (700), 3 states have internal predecessors, (700), 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:04,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:04,046 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] [2025-01-09 21:23:04,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:23:04,046 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1165486800, now seen corresponding path program 1 times [2025-01-09 21:23:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:04,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908843798] [2025-01-09 21:23:04,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:04,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:23:04,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:23:04,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:04,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:04,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:04,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908843798] [2025-01-09 21:23:04,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908843798] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:04,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:04,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:23:04,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753373435] [2025-01-09 21:23:04,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:04,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:23:04,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:04,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:23:04,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:23:04,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 249 [2025-01-09 21:23:04,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 243 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:04,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:04,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 249 [2025-01-09 21:23:04,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:04,212 INFO L124 PetriNetUnfolderBase]: 24/456 cut-off events. [2025-01-09 21:23:04,213 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:04,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 527 conditions, 456 events. 24/456 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1210 event pairs, 24 based on Foata normal form. 0/425 useless extension candidates. Maximal degree in co-relation 419. Up to 63 conditions per place. [2025-01-09 21:23:04,216 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 15 selfloop transitions, 1 changer transitions 0/238 dead transitions. [2025-01-09 21:23:04,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 238 transitions, 514 flow [2025-01-09 21:23:04,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:23:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:23:04,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-01-09 21:23:04,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9437751004016064 [2025-01-09 21:23:04,219 INFO L175 Difference]: Start difference. First operand has 248 places, 243 transitions, 492 flow. Second operand 3 states and 705 transitions. [2025-01-09 21:23:04,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 238 transitions, 514 flow [2025-01-09 21:23:04,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 238 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:23:04,224 INFO L231 Difference]: Finished difference. Result has 243 places, 238 transitions, 480 flow [2025-01-09 21:23:04,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=243, PETRI_TRANSITIONS=238} [2025-01-09 21:23:04,225 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -9 predicate places. [2025-01-09 21:23:04,226 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 238 transitions, 480 flow [2025-01-09 21:23:04,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 229.0) internal successors, (687), 3 states have internal predecessors, (687), 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:04,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:04,227 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] [2025-01-09 21:23:04,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:23:04,227 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:04,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -264416534, now seen corresponding path program 1 times [2025-01-09 21:23:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:04,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173438430] [2025-01-09 21:23:04,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:04,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:04,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 21:23:04,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 21:23:04,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:04,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:04,815 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:04,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:04,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173438430] [2025-01-09 21:23:04,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173438430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:04,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:04,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:04,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074224781] [2025-01-09 21:23:04,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:04,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:04,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:04,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:04,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:05,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 185 out of 249 [2025-01-09 21:23:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 238 transitions, 480 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:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:05,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 185 of 249 [2025-01-09 21:23:05,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:05,375 INFO L124 PetriNetUnfolderBase]: 288/1209 cut-off events. [2025-01-09 21:23:05,375 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:23:05,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1209 events. 288/1209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6307 event pairs, 288 based on Foata normal form. 0/1150 useless extension candidates. Maximal degree in co-relation 1736. Up to 635 conditions per place. [2025-01-09 21:23:05,382 INFO L140 encePairwiseOnDemand]: 243/249 looper letters, 58 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-01-09 21:23:05,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 237 transitions, 604 flow [2025-01-09 21:23:05,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:05,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:05,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1174 transitions. [2025-01-09 21:23:05,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.785809906291834 [2025-01-09 21:23:05,385 INFO L175 Difference]: Start difference. First operand has 243 places, 238 transitions, 480 flow. Second operand 6 states and 1174 transitions. [2025-01-09 21:23:05,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 237 transitions, 604 flow [2025-01-09 21:23:05,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 237 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:05,390 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 487 flow [2025-01-09 21:23:05,390 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2025-01-09 21:23:05,391 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -6 predicate places. [2025-01-09 21:23:05,391 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 487 flow [2025-01-09 21:23:05,392 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:05,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:05,392 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] [2025-01-09 21:23:05,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:23:05,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:05,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:05,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1517100340, now seen corresponding path program 1 times [2025-01-09 21:23:05,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:05,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68048584] [2025-01-09 21:23:05,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:05,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:05,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 21:23:05,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 21:23:05,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:05,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:05,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68048584] [2025-01-09 21:23:05,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68048584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808575166] [2025-01-09 21:23:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:05,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:05,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:05,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:06,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2025-01-09 21:23:06,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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:06,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:06,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2025-01-09 21:23:06,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:06,607 INFO L124 PetriNetUnfolderBase]: 316/1535 cut-off events. [2025-01-09 21:23:06,607 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:23:06,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2271 conditions, 1535 events. 316/1535 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9256 event pairs, 36 based on Foata normal form. 0/1445 useless extension candidates. Maximal degree in co-relation 2154. Up to 380 conditions per place. [2025-01-09 21:23:06,613 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 99 selfloop transitions, 70 changer transitions 0/349 dead transitions. [2025-01-09 21:23:06,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 349 transitions, 1049 flow [2025-01-09 21:23:06,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-01-09 21:23:06,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8855421686746988 [2025-01-09 21:23:06,619 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 487 flow. Second operand 6 states and 1323 transitions. [2025-01-09 21:23:06,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 349 transitions, 1049 flow [2025-01-09 21:23:06,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 349 transitions, 1039 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:06,627 INFO L231 Difference]: Finished difference. Result has 250 places, 307 transitions, 955 flow [2025-01-09 21:23:06,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=955, PETRI_PLACES=250, PETRI_TRANSITIONS=307} [2025-01-09 21:23:06,629 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, -2 predicate places. [2025-01-09 21:23:06,631 INFO L471 AbstractCegarLoop]: Abstraction has has 250 places, 307 transitions, 955 flow [2025-01-09 21:23:06,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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:06,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:06,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:23:06,632 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:06,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:06,633 INFO L85 PathProgramCache]: Analyzing trace with hash -656122962, now seen corresponding path program 1 times [2025-01-09 21:23:06,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:06,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142875546] [2025-01-09 21:23:06,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:06,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:06,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 21:23:06,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 21:23:06,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:06,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:07,094 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:07,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:07,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142875546] [2025-01-09 21:23:07,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142875546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:07,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:07,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5801298] [2025-01-09 21:23:07,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:07,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:07,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:07,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:07,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 249 [2025-01-09 21:23:07,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 307 transitions, 955 flow. Second operand has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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:07,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:07,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 249 [2025-01-09 21:23:07,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:07,843 INFO L124 PetriNetUnfolderBase]: 588/2306 cut-off events. [2025-01-09 21:23:07,844 INFO L125 PetriNetUnfolderBase]: For 603/609 co-relation queries the response was YES. [2025-01-09 21:23:07,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4695 conditions, 2306 events. 588/2306 cut-off events. For 603/609 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 15128 event pairs, 222 based on Foata normal form. 0/2194 useless extension candidates. Maximal degree in co-relation 4576. Up to 1082 conditions per place. [2025-01-09 21:23:07,858 INFO L140 encePairwiseOnDemand]: 234/249 looper letters, 106 selfloop transitions, 48 changer transitions 0/358 dead transitions. [2025-01-09 21:23:07,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 255 places, 358 transitions, 1435 flow [2025-01-09 21:23:07,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:07,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:07,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1260 transitions. [2025-01-09 21:23:07,862 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8433734939759037 [2025-01-09 21:23:07,862 INFO L175 Difference]: Start difference. First operand has 250 places, 307 transitions, 955 flow. Second operand 6 states and 1260 transitions. [2025-01-09 21:23:07,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 255 places, 358 transitions, 1435 flow [2025-01-09 21:23:07,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 255 places, 358 transitions, 1435 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:07,875 INFO L231 Difference]: Finished difference. Result has 260 places, 350 transitions, 1343 flow [2025-01-09 21:23:07,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1343, PETRI_PLACES=260, PETRI_TRANSITIONS=350} [2025-01-09 21:23:07,878 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 8 predicate places. [2025-01-09 21:23:07,878 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 350 transitions, 1343 flow [2025-01-09 21:23:07,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 197.83333333333334) internal successors, (1187), 6 states have internal predecessors, (1187), 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:07,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:07,879 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] [2025-01-09 21:23:07,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:23:07,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:07,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:07,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1849978901, now seen corresponding path program 1 times [2025-01-09 21:23:07,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:07,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828350954] [2025-01-09 21:23:07,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:07,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:07,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:23:07,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:23:07,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:07,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:08,320 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:08,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:08,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828350954] [2025-01-09 21:23:08,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828350954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:23:08,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421422430] [2025-01-09 21:23:08,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:08,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:23:08,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:08,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:23:08,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:23:08,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 249 [2025-01-09 21:23:08,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 350 transitions, 1343 flow. Second operand has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 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:08,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:08,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 249 [2025-01-09 21:23:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:09,069 INFO L124 PetriNetUnfolderBase]: 743/2863 cut-off events. [2025-01-09 21:23:09,070 INFO L125 PetriNetUnfolderBase]: For 1673/1738 co-relation queries the response was YES. [2025-01-09 21:23:09,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6639 conditions, 2863 events. 743/2863 cut-off events. For 1673/1738 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 20214 event pairs, 86 based on Foata normal form. 0/2772 useless extension candidates. Maximal degree in co-relation 6513. Up to 1023 conditions per place. [2025-01-09 21:23:09,089 INFO L140 encePairwiseOnDemand]: 226/249 looper letters, 128 selfloop transitions, 136 changer transitions 4/490 dead transitions. [2025-01-09 21:23:09,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 265 places, 490 transitions, 2635 flow [2025-01-09 21:23:09,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:23:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:23:09,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1318 transitions. [2025-01-09 21:23:09,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8821954484605087 [2025-01-09 21:23:09,092 INFO L175 Difference]: Start difference. First operand has 260 places, 350 transitions, 1343 flow. Second operand 6 states and 1318 transitions. [2025-01-09 21:23:09,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 265 places, 490 transitions, 2635 flow [2025-01-09 21:23:09,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 490 transitions, 2617 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:09,113 INFO L231 Difference]: Finished difference. Result has 270 places, 481 transitions, 2691 flow [2025-01-09 21:23:09,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=1325, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2691, PETRI_PLACES=270, PETRI_TRANSITIONS=481} [2025-01-09 21:23:09,117 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 18 predicate places. [2025-01-09 21:23:09,117 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 481 transitions, 2691 flow [2025-01-09 21:23:09,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.0) internal successors, (1218), 6 states have internal predecessors, (1218), 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:09,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:09,118 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] [2025-01-09 21:23:09,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:23:09,119 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:09,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:09,119 INFO L85 PathProgramCache]: Analyzing trace with hash 642851118, now seen corresponding path program 1 times [2025-01-09 21:23:09,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:09,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630645481] [2025-01-09 21:23:09,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:09,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:09,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:23:09,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:09,160 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:09,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:09,976 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:09,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:09,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630645481] [2025-01-09 21:23:09,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630645481] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:09,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:09,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:09,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523123482] [2025-01-09 21:23:09,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:09,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:09,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:09,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:09,979 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:11,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-01-09 21:23:11,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 481 transitions, 2691 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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:11,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:11,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-01-09 21:23:11,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:12,629 INFO L124 PetriNetUnfolderBase]: 1151/4174 cut-off events. [2025-01-09 21:23:12,629 INFO L125 PetriNetUnfolderBase]: For 5352/5456 co-relation queries the response was YES. [2025-01-09 21:23:12,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11940 conditions, 4174 events. 1151/4174 cut-off events. For 5352/5456 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 32994 event pairs, 78 based on Foata normal form. 35/4115 useless extension candidates. Maximal degree in co-relation 11806. Up to 880 conditions per place. [2025-01-09 21:23:12,654 INFO L140 encePairwiseOnDemand]: 212/249 looper letters, 349 selfloop transitions, 159 changer transitions 4/705 dead transitions. [2025-01-09 21:23:12,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 705 transitions, 5131 flow [2025-01-09 21:23:12,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 2777 transitions. [2025-01-09 21:23:12,660 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7966150315547906 [2025-01-09 21:23:12,660 INFO L175 Difference]: Start difference. First operand has 270 places, 481 transitions, 2691 flow. Second operand 14 states and 2777 transitions. [2025-01-09 21:23:12,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 705 transitions, 5131 flow [2025-01-09 21:23:12,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 705 transitions, 5059 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:12,690 INFO L231 Difference]: Finished difference. Result has 293 places, 544 transitions, 3964 flow [2025-01-09 21:23:12,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=2655, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=481, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=96, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=3964, PETRI_PLACES=293, PETRI_TRANSITIONS=544} [2025-01-09 21:23:12,691 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 41 predicate places. [2025-01-09 21:23:12,692 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 544 transitions, 3964 flow [2025-01-09 21:23:12,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:12,693 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] [2025-01-09 21:23:12,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:23:12,694 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:12,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:12,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1158483018, now seen corresponding path program 2 times [2025-01-09 21:23:12,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:12,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945816035] [2025-01-09 21:23:12,695 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:12,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:12,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:23:12,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:12,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:12,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:13,343 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,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:13,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945816035] [2025-01-09 21:23:13,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945816035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:13,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:13,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928865202] [2025-01-09 21:23:13,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:13,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:13,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:13,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:14,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-01-09 21:23:14,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 544 transitions, 3964 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:14,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-01-09 21:23:14,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:15,841 INFO L124 PetriNetUnfolderBase]: 1253/4614 cut-off events. [2025-01-09 21:23:15,841 INFO L125 PetriNetUnfolderBase]: For 9610/9714 co-relation queries the response was YES. [2025-01-09 21:23:15,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14561 conditions, 4614 events. 1253/4614 cut-off events. For 9610/9714 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 37093 event pairs, 125 based on Foata normal form. 37/4535 useless extension candidates. Maximal degree in co-relation 14413. Up to 891 conditions per place. [2025-01-09 21:23:15,867 INFO L140 encePairwiseOnDemand]: 228/249 looper letters, 440 selfloop transitions, 103 changer transitions 0/736 dead transitions. [2025-01-09 21:23:15,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 736 transitions, 6508 flow [2025-01-09 21:23:15,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:15,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:15,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3604 transitions. [2025-01-09 21:23:15,873 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7617839780173324 [2025-01-09 21:23:15,873 INFO L175 Difference]: Start difference. First operand has 293 places, 544 transitions, 3964 flow. Second operand 19 states and 3604 transitions. [2025-01-09 21:23:15,873 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 736 transitions, 6508 flow [2025-01-09 21:23:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 308 places, 736 transitions, 6503 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:15,920 INFO L231 Difference]: Finished difference. Result has 317 places, 599 transitions, 4779 flow [2025-01-09 21:23:15,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=3959, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4779, PETRI_PLACES=317, PETRI_TRANSITIONS=599} [2025-01-09 21:23:15,923 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 65 predicate places. [2025-01-09 21:23:15,923 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 599 transitions, 4779 flow [2025-01-09 21:23:15,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:15,924 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] [2025-01-09 21:23:15,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:15,925 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:15,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:15,926 INFO L85 PathProgramCache]: Analyzing trace with hash -370482976, now seen corresponding path program 3 times [2025-01-09 21:23:15,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:15,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704339551] [2025-01-09 21:23:15,926 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:15,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:15,954 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:23:15,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:15,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:15,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:16,641 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:16,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:16,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704339551] [2025-01-09 21:23:16,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704339551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:16,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:16,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:16,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162446536] [2025-01-09 21:23:16,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:16,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:16,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:16,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:16,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:17,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-01-09 21:23:17,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 599 transitions, 4779 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:17,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-01-09 21:23:17,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:19,088 INFO L124 PetriNetUnfolderBase]: 1790/6487 cut-off events. [2025-01-09 21:23:19,088 INFO L125 PetriNetUnfolderBase]: For 17776/17967 co-relation queries the response was YES. [2025-01-09 21:23:19,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21812 conditions, 6487 events. 1790/6487 cut-off events. For 17776/17967 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 58250 event pairs, 144 based on Foata normal form. 55/6368 useless extension candidates. Maximal degree in co-relation 21654. Up to 1298 conditions per place. [2025-01-09 21:23:19,120 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 450 selfloop transitions, 226 changer transitions 3/872 dead transitions. [2025-01-09 21:23:19,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 872 transitions, 8587 flow [2025-01-09 21:23:19,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 21:23:19,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-01-09 21:23:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3860 transitions. [2025-01-09 21:23:19,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7751004016064257 [2025-01-09 21:23:19,127 INFO L175 Difference]: Start difference. First operand has 317 places, 599 transitions, 4779 flow. Second operand 20 states and 3860 transitions. [2025-01-09 21:23:19,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 872 transitions, 8587 flow [2025-01-09 21:23:19,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 872 transitions, 8551 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:19,198 INFO L231 Difference]: Finished difference. Result has 342 places, 693 transitions, 6986 flow [2025-01-09 21:23:19,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=4753, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=132, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=381, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=6986, PETRI_PLACES=342, PETRI_TRANSITIONS=693} [2025-01-09 21:23:19,199 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 90 predicate places. [2025-01-09 21:23:19,199 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 693 transitions, 6986 flow [2025-01-09 21:23:19,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:19,200 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] [2025-01-09 21:23:19,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:19,200 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:19,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:19,201 INFO L85 PathProgramCache]: Analyzing trace with hash -878427960, now seen corresponding path program 4 times [2025-01-09 21:23:19,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:19,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198004867] [2025-01-09 21:23:19,202 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:19,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:19,225 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 164 statements into 2 equivalence classes. [2025-01-09 21:23:19,234 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 148 of 164 statements. [2025-01-09 21:23:19,235 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-09 21:23:19,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:19,766 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:19,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:19,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198004867] [2025-01-09 21:23:19,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198004867] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:19,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:19,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:19,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357125097] [2025-01-09 21:23:19,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:19,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:19,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:19,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:19,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:20,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-01-09 21:23:20,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 693 transitions, 6986 flow. Second operand has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:20,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-01-09 21:23:20,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:22,966 INFO L124 PetriNetUnfolderBase]: 2505/8900 cut-off events. [2025-01-09 21:23:22,966 INFO L125 PetriNetUnfolderBase]: For 36019/36331 co-relation queries the response was YES. [2025-01-09 21:23:22,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32607 conditions, 8900 events. 2505/8900 cut-off events. For 36019/36331 co-relation queries the response was YES. Maximal size of possible extension queue 308. Compared 87164 event pairs, 147 based on Foata normal form. 98/8761 useless extension candidates. Maximal degree in co-relation 32437. Up to 1807 conditions per place. [2025-01-09 21:23:23,023 INFO L140 encePairwiseOnDemand]: 220/249 looper letters, 510 selfloop transitions, 301 changer transitions 0/1004 dead transitions. [2025-01-09 21:23:23,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1004 transitions, 12268 flow [2025-01-09 21:23:23,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 21:23:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-01-09 21:23:23,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3629 transitions. [2025-01-09 21:23:23,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7670682730923695 [2025-01-09 21:23:23,029 INFO L175 Difference]: Start difference. First operand has 342 places, 693 transitions, 6986 flow. Second operand 19 states and 3629 transitions. [2025-01-09 21:23:23,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1004 transitions, 12268 flow [2025-01-09 21:23:23,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 1004 transitions, 12226 flow, removed 11 selfloop flow, removed 7 redundant places. [2025-01-09 21:23:23,179 INFO L231 Difference]: Finished difference. Result has 362 places, 806 transitions, 10052 flow [2025-01-09 21:23:23,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=6944, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=199, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=414, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10052, PETRI_PLACES=362, PETRI_TRANSITIONS=806} [2025-01-09 21:23:23,180 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 110 predicate places. [2025-01-09 21:23:23,181 INFO L471 AbstractCegarLoop]: Abstraction has has 362 places, 806 transitions, 10052 flow [2025-01-09 21:23:23,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 183.07692307692307) internal successors, (2380), 13 states have internal predecessors, (2380), 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,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:23,182 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] [2025-01-09 21:23:23,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:23,182 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:23,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:23,183 INFO L85 PathProgramCache]: Analyzing trace with hash -857358, now seen corresponding path program 5 times [2025-01-09 21:23:23,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:23,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041364814] [2025-01-09 21:23:23,183 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:23,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:23,207 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-01-09 21:23:23,216 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:23,216 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:23:23,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:23,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:23,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041364814] [2025-01-09 21:23:23,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041364814] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:23,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416502807] [2025-01-09 21:23:23,868 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:23,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:23,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:23,871 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:23,873 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:24,011 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 164 statements into 2 equivalence classes. [2025-01-09 21:23:24,065 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:24,065 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:23:24,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:24,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 21:23:24,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:24,119 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:24,208 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:23:24,208 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:24,219 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 13 treesize of output 9 [2025-01-09 21:23:24,227 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 23 treesize of output 22 [2025-01-09 21:23:24,241 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:24,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-01-09 21:23:24,295 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:24,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-01-09 21:23:24,351 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 45 treesize of output 34 [2025-01-09 21:23:24,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:24,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:24,398 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= 0 (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)))) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 7)) 0))) is different from false [2025-01-09 21:23:24,465 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)))) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0))))) is different from false [2025-01-09 21:23:24,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-01-09 21:23:24,575 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-01-09 21:23:24,607 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1359 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1359) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-01-09 21:23:26,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:26,525 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 53 [2025-01-09 21:23:26,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:26,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 36 [2025-01-09 21:23:26,544 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:26,544 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:26,550 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:26,551 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:26,559 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-01-09 21:23:26,559 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-01-09 21:23:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:26,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416502807] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:23:26,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:23:26,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-01-09 21:23:26,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992723322] [2025-01-09 21:23:26,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:23:26,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-01-09 21:23:26,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:26,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-01-09 21:23:26,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=192, Unknown=16, NotChecked=160, Total=420 [2025-01-09 21:23:26,689 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 249 [2025-01-09 21:23:26,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 362 places, 806 transitions, 10052 flow. Second operand has 21 states, 21 states have (on average 151.0) internal successors, (3171), 21 states have internal predecessors, (3171), 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:26,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:26,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 249 [2025-01-09 21:23:26,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:31,596 INFO L124 PetriNetUnfolderBase]: 5458/15195 cut-off events. [2025-01-09 21:23:31,596 INFO L125 PetriNetUnfolderBase]: For 71374/71680 co-relation queries the response was YES. [2025-01-09 21:23:31,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60459 conditions, 15195 events. 5458/15195 cut-off events. For 71374/71680 co-relation queries the response was YES. Maximal size of possible extension queue 445. Compared 149595 event pairs, 1190 based on Foata normal form. 64/14772 useless extension candidates. Maximal degree in co-relation 60275. Up to 3864 conditions per place. [2025-01-09 21:23:31,721 INFO L140 encePairwiseOnDemand]: 216/249 looper letters, 776 selfloop transitions, 321 changer transitions 6/1244 dead transitions. [2025-01-09 21:23:31,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 383 places, 1244 transitions, 16316 flow [2025-01-09 21:23:31,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 21:23:31,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-09 21:23:31,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 3649 transitions. [2025-01-09 21:23:31,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6661190215407082 [2025-01-09 21:23:31,725 INFO L175 Difference]: Start difference. First operand has 362 places, 806 transitions, 10052 flow. Second operand 22 states and 3649 transitions. [2025-01-09 21:23:31,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 383 places, 1244 transitions, 16316 flow [2025-01-09 21:23:31,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 1244 transitions, 16210 flow, removed 35 selfloop flow, removed 9 redundant places. [2025-01-09 21:23:32,008 INFO L231 Difference]: Finished difference. Result has 383 places, 886 transitions, 12912 flow [2025-01-09 21:23:32,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=9946, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=806, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=243, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=12912, PETRI_PLACES=383, PETRI_TRANSITIONS=886} [2025-01-09 21:23:32,008 INFO L279 CegarLoopForPetriNet]: 252 programPoint places, 131 predicate places. [2025-01-09 21:23:32,009 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 886 transitions, 12912 flow [2025-01-09 21:23:32,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 151.0) internal successors, (3171), 21 states have internal predecessors, (3171), 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:32,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:32,010 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] [2025-01-09 21:23:32,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:23:32,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-01-09 21:23:32,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2025-01-09 21:23:32,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:32,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1075750556, now seen corresponding path program 6 times [2025-01-09 21:23:32,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:32,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254218844] [2025-01-09 21:23:32,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:32,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:32,236 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 2 equivalence classes. [2025-01-09 21:23:32,257 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:32,257 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 21:23:32,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:33,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:33,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254218844] [2025-01-09 21:23:33,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254218844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621482334] [2025-01-09 21:23:33,021 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:33,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:33,024 INFO L229 MonitoredProcess]: Starting monitored process 3 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:33,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:23:33,165 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 164 statements into 2 equivalence classes. [2025-01-09 21:23:33,566 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:23:33,566 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-01-09 21:23:33,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:33,569 INFO L256 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-01-09 21:23:33,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:33,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:33,806 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 13 treesize of output 9 [2025-01-09 21:23:33,837 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 23 treesize of output 22 [2025-01-09 21:23:33,869 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 32 treesize of output 34 [2025-01-09 21:23:33,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-01-09 21:23:33,902 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:33,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2025-01-09 21:23:34,207 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 0 case distinctions, treesize of input 52 treesize of output 49 [2025-01-09 21:23:34,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:34,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:36,240 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:23:36,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621482334] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:23:36,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:23:36,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 34 [2025-01-09 21:23:36,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379584223] [2025-01-09 21:23:36,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:23:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-01-09 21:23:36,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-01-09 21:23:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1007, Unknown=0, NotChecked=0, Total=1190 [2025-01-09 21:23:47,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:23:55,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:02,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-01-09 21:24:13,122 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]