./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 02:13:27,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 02:13:27,179 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 02:13:27,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 02:13:27,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 02:13:27,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 02:13:27,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 02:13:27,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 02:13:27,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 02:13:27,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 02:13:27,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 02:13:27,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 02:13:27,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 02:13:27,213 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 02:13:27,213 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 02:13:27,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 02:13:27,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 02:13:27,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:13:27,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 02:13:27,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 02:13:27,216 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 02:13:27,216 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 02:13:27,216 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a [2025-03-04 02:13:27,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 02:13:27,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 02:13:27,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 02:13:27,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 02:13:27,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 02:13:27,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-04 02:13:28,689 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e098e53f7/dc69fb3a007b49e7bf54b8371291b594/FLAGd6dd139d0 [2025-03-04 02:13:28,968 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 02:13:28,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-04 02:13:28,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e098e53f7/dc69fb3a007b49e7bf54b8371291b594/FLAGd6dd139d0 [2025-03-04 02:13:28,996 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e098e53f7/dc69fb3a007b49e7bf54b8371291b594 [2025-03-04 02:13:28,998 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 02:13:29,004 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 02:13:29,005 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 02:13:29,005 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 02:13:29,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 02:13:29,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:13:28" (1/1) ... [2025-03-04 02:13:29,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5957c667 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29, skipping insertion in model container [2025-03-04 02:13:29,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 02:13:28" (1/1) ... [2025-03-04 02:13:29,034 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 02:13:29,166 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i[820,833] [2025-03-04 02:13:29,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:13:29,461 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 02:13:29,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i[820,833] [2025-03-04 02:13:29,500 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 02:13:29,547 INFO L204 MainTranslator]: Completed translation [2025-03-04 02:13:29,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29 WrapperNode [2025-03-04 02:13:29,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 02:13:29,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 02:13:29,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 02:13:29,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 02:13:29,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,573 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,586 INFO L138 Inliner]: procedures = 364, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-04 02:13:29,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 02:13:29,587 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 02:13:29,587 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 02:13:29,587 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 02:13:29,592 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,595 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,604 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-04 02:13:29,605 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,605 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,608 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,611 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,614 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 02:13:29,615 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 02:13:29,615 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 02:13:29,615 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 02:13:29,616 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (1/1) ... [2025-03-04 02:13:29,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 02:13:29,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:29,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 02:13:29,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-04 02:13:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 02:13:29,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 02:13:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 02:13:29,655 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 02:13:29,759 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 02:13:29,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 02:13:29,902 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 02:13:29,904 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 02:13:30,002 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 02:13:30,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 02:13:30,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:13:30 BoogieIcfgContainer [2025-03-04 02:13:30,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 02:13:30,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 02:13:30,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 02:13:30,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 02:13:30,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 02:13:28" (1/3) ... [2025-03-04 02:13:30,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b7444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:13:30, skipping insertion in model container [2025-03-04 02:13:30,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 02:13:29" (2/3) ... [2025-03-04 02:13:30,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192b7444 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 02:13:30, skipping insertion in model container [2025-03-04 02:13:30,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 02:13:30" (3/3) ... [2025-03-04 02:13:30,011 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-04 02:13:30,021 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 02:13:30,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 22 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-03-04 02:13:30,024 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 02:13:30,061 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 02:13:30,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 55 flow [2025-03-04 02:13:30,114 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-03-04 02:13:30,115 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:13:30,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28 conditions, 23 events. 3/23 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 0/19 useless extension candidates. Maximal degree in co-relation 14. Up to 2 conditions per place. [2025-03-04 02:13:30,118 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 55 flow [2025-03-04 02:13:30,120 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 46 flow [2025-03-04 02:13:30,143 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 02:13:30,158 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;@a5f627f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 02:13:30,160 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 02:13:30,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 02:13:30,168 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-04 02:13:30,168 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:13:30,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:30,169 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:30,169 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:30,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:30,174 INFO L85 PathProgramCache]: Analyzing trace with hash 586663073, now seen corresponding path program 1 times [2025-03-04 02:13:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:30,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244472189] [2025-03-04 02:13:30,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:30,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 02:13:30,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 02:13:30,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:30,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:30,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:30,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:30,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244472189] [2025-03-04 02:13:30,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244472189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:30,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:30,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:30,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47023289] [2025-03-04 02:13:30,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:13:30,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:30,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:13:30,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:13:30,395 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:13:30,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 22 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:30,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:13:30,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:30,474 INFO L124 PetriNetUnfolderBase]: 61/134 cut-off events. [2025-03-04 02:13:30,474 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 02:13:30,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 134 events. 61/134 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 409 event pairs, 27 based on Foata normal form. 6/139 useless extension candidates. Maximal degree in co-relation 248. Up to 77 conditions per place. [2025-03-04 02:13:30,478 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-03-04 02:13:30,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 118 flow [2025-03-04 02:13:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:13:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:13:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-04 02:13:30,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 02:13:30,487 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 46 flow. Second operand 3 states and 45 transitions. [2025-03-04 02:13:30,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 118 flow [2025-03-04 02:13:30,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:30,492 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 54 flow [2025-03-04 02:13:30,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=20, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=23, PETRI_TRANSITIONS=21} [2025-03-04 02:13:30,497 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-03-04 02:13:30,499 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 54 flow [2025-03-04 02:13:30,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:30,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:30,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 02:13:30,500 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:30,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:30,500 INFO L85 PathProgramCache]: Analyzing trace with hash 64502193, now seen corresponding path program 1 times [2025-03-04 02:13:30,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:30,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112658541] [2025-03-04 02:13:30,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:30,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 02:13:30,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 02:13:30,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:30,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:30,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:13:30,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:30,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112658541] [2025-03-04 02:13:30,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112658541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:30,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:30,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:30,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283172912] [2025-03-04 02:13:30,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:30,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:13:30,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:30,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:13:30,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:13:30,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-04 02:13:30,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 21 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:30,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-04 02:13:30,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:30,639 INFO L124 PetriNetUnfolderBase]: 91/207 cut-off events. [2025-03-04 02:13:30,639 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 02:13:30,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 207 events. 91/207 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 729 event pairs, 46 based on Foata normal form. 9/216 useless extension candidates. Maximal degree in co-relation 144. Up to 113 conditions per place. [2025-03-04 02:13:30,640 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-04 02:13:30,641 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 134 flow [2025-03-04 02:13:30,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:13:30,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:13:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-04 02:13:30,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-04 02:13:30,642 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 54 flow. Second operand 3 states and 46 transitions. [2025-03-04 02:13:30,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 134 flow [2025-03-04 02:13:30,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:13:30,643 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 64 flow [2025-03-04 02:13:30,643 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=25, PETRI_TRANSITIONS=22} [2025-03-04 02:13:30,643 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2025-03-04 02:13:30,644 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 64 flow [2025-03-04 02:13:30,644 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,644 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:30,644 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:30,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 02:13:30,644 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:30,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:30,645 INFO L85 PathProgramCache]: Analyzing trace with hash -832312549, now seen corresponding path program 1 times [2025-03-04 02:13:30,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:30,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265304934] [2025-03-04 02:13:30,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 02:13:30,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:30,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:13:30,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:13:30,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:30,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:30,776 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:30,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:30,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265304934] [2025-03-04 02:13:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265304934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:30,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:30,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 02:13:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125094443] [2025-03-04 02:13:30,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:30,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 02:13:30,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:30,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 02:13:30,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 02:13:30,778 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-04 02:13:30,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:30,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-04 02:13:30,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:30,849 INFO L124 PetriNetUnfolderBase]: 59/153 cut-off events. [2025-03-04 02:13:30,849 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-04 02:13:30,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 153 events. 59/153 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 468 event pairs, 20 based on Foata normal form. 16/168 useless extension candidates. Maximal degree in co-relation 117. Up to 72 conditions per place. [2025-03-04 02:13:30,850 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 20 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-03-04 02:13:30,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 142 flow [2025-03-04 02:13:30,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 02:13:30,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 02:13:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-04 02:13:30,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-03-04 02:13:30,852 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 64 flow. Second operand 3 states and 43 transitions. [2025-03-04 02:13:30,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 142 flow [2025-03-04 02:13:30,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:13:30,853 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 70 flow [2025-03-04 02:13:30,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=26, PETRI_TRANSITIONS=22} [2025-03-04 02:13:30,854 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2025-03-04 02:13:30,854 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 70 flow [2025-03-04 02:13:30,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,854 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:30,854 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:30,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 02:13:30,854 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:30,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:30,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1991320131, now seen corresponding path program 2 times [2025-03-04 02:13:30,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:30,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274685709] [2025-03-04 02:13:30,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:13:30,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:30,864 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-04 02:13:30,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-04 02:13:30,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 02:13:30,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:30,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:30,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:30,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274685709] [2025-03-04 02:13:30,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274685709] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:30,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:30,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:13:30,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292611233] [2025-03-04 02:13:30,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:30,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:30,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:30,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:30,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:30,951 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-04 02:13:30,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 22 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:30,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:30,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-04 02:13:30,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:31,023 INFO L124 PetriNetUnfolderBase]: 79/214 cut-off events. [2025-03-04 02:13:31,025 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-04 02:13:31,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 556 conditions, 214 events. 79/214 cut-off events. For 94/94 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 727 event pairs, 20 based on Foata normal form. 9/223 useless extension candidates. Maximal degree in co-relation 183. Up to 89 conditions per place. [2025-03-04 02:13:31,027 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 33 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-03-04 02:13:31,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 210 flow [2025-03-04 02:13:31,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:31,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:31,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-04 02:13:31,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 02:13:31,029 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 70 flow. Second operand 4 states and 62 transitions. [2025-03-04 02:13:31,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 210 flow [2025-03-04 02:13:31,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 02:13:31,031 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 82 flow [2025-03-04 02:13:31,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=82, PETRI_PLACES=29, PETRI_TRANSITIONS=23} [2025-03-04 02:13:31,032 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-03-04 02:13:31,033 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 82 flow [2025-03-04 02:13:31,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:31,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:31,033 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 02:13:31,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash 2063330419, now seen corresponding path program 3 times [2025-03-04 02:13:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194701921] [2025-03-04 02:13:31,036 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:13:31,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:31,047 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-04 02:13:31,051 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 25 statements. [2025-03-04 02:13:31,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 02:13:31,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:31,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:13:31,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:31,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194701921] [2025-03-04 02:13:31,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194701921] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:13:31,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:13:31,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 02:13:31,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599640136] [2025-03-04 02:13:31,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:13:31,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 02:13:31,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:31,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 02:13:31,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 02:13:31,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:13:31,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 23 transitions, 82 flow. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:31,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:31,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:13:31,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:31,163 INFO L124 PetriNetUnfolderBase]: 125/328 cut-off events. [2025-03-04 02:13:31,164 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-03-04 02:13:31,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 328 events. 125/328 cut-off events. For 308/308 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1282 event pairs, 35 based on Foata normal form. 14/341 useless extension candidates. Maximal degree in co-relation 269. Up to 137 conditions per place. [2025-03-04 02:13:31,168 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-03-04 02:13:31,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 266 flow [2025-03-04 02:13:31,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 02:13:31,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 02:13:31,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-04 02:13:31,170 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-03-04 02:13:31,170 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 82 flow. Second operand 4 states and 61 transitions. [2025-03-04 02:13:31,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 266 flow [2025-03-04 02:13:31,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:31,172 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 92 flow [2025-03-04 02:13:31,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2025-03-04 02:13:31,173 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2025-03-04 02:13:31,173 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 92 flow [2025-03-04 02:13:31,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:31,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:31,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:31,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 02:13:31,173 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 758716615, now seen corresponding path program 4 times [2025-03-04 02:13:31,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:31,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177688256] [2025-03-04 02:13:31,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:13:31,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:31,185 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:13:31,202 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:13:31,203 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:13:31,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:13:31,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177688256] [2025-03-04 02:13:31,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177688256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:31,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24822158] [2025-03-04 02:13:31,273 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:13:31,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:31,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:31,276 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:31,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 02:13:31,322 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-04 02:13:31,340 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 02:13:31,341 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:13:31,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:31,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:13:31,344 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:31,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:13:31,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 02:13:31,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24822158] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:31,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:31,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-04 02:13:31,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907225067] [2025-03-04 02:13:31,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:31,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 02:13:31,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:31,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 02:13:31,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-04 02:13:31,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:13:31,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 92 flow. Second operand has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:31,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:31,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:13:31,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:31,625 INFO L124 PetriNetUnfolderBase]: 319/729 cut-off events. [2025-03-04 02:13:31,625 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2025-03-04 02:13:31,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 729 events. 319/729 cut-off events. For 645/645 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2843 event pairs, 35 based on Foata normal form. 56/785 useless extension candidates. Maximal degree in co-relation 775. Up to 132 conditions per place. [2025-03-04 02:13:31,629 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 85 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2025-03-04 02:13:31,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 96 transitions, 552 flow [2025-03-04 02:13:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:13:31,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:13:31,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-03-04 02:13:31,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-04 02:13:31,630 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 92 flow. Second operand 8 states and 123 transitions. [2025-03-04 02:13:31,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 96 transitions, 552 flow [2025-03-04 02:13:31,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 96 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:31,633 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 144 flow [2025-03-04 02:13:31,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2025-03-04 02:13:31,634 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2025-03-04 02:13:31,634 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 144 flow [2025-03-04 02:13:31,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.875) internal successors, (79), 8 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:31,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:31,634 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:31,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 02:13:31,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 02:13:31,839 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:31,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:31,840 INFO L85 PathProgramCache]: Analyzing trace with hash 700427721, now seen corresponding path program 5 times [2025-03-04 02:13:31,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:31,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649183988] [2025-03-04 02:13:31,840 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:13:31,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:31,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-03-04 02:13:31,872 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:13:31,872 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 02:13:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:31,994 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:13:31,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649183988] [2025-03-04 02:13:31,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649183988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:31,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421410336] [2025-03-04 02:13:31,995 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:13:31,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:31,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:31,997 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:31,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 02:13:32,045 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-03-04 02:13:32,071 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 02:13:32,071 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-04 02:13:32,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:32,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:13:32,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:13:32,148 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:32,283 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 02:13:32,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421410336] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:32,283 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:32,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-04 02:13:32,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36499534] [2025-03-04 02:13:32,283 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:32,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-04 02:13:32,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:32,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-04 02:13:32,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-04 02:13:32,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:13:32,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 144 flow. Second operand has 16 states, 16 states have (on average 10.0625) internal successors, (161), 16 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:32,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:32,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:13:32,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:32,596 INFO L124 PetriNetUnfolderBase]: 687/1551 cut-off events. [2025-03-04 02:13:32,596 INFO L125 PetriNetUnfolderBase]: For 2946/2946 co-relation queries the response was YES. [2025-03-04 02:13:32,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5143 conditions, 1551 events. 687/1551 cut-off events. For 2946/2946 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6386 event pairs, 20 based on Foata normal form. 112/1663 useless extension candidates. Maximal degree in co-relation 2297. Up to 292 conditions per place. [2025-03-04 02:13:32,604 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 181 selfloop transitions, 16 changer transitions 0/200 dead transitions. [2025-03-04 02:13:32,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 200 transitions, 1266 flow [2025-03-04 02:13:32,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:13:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:13:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 255 transitions. [2025-03-04 02:13:32,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2025-03-04 02:13:32,606 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 144 flow. Second operand 16 states and 255 transitions. [2025-03-04 02:13:32,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 200 transitions, 1266 flow [2025-03-04 02:13:32,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 200 transitions, 1214 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:32,612 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 248 flow [2025-03-04 02:13:32,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=248, PETRI_PLACES=63, PETRI_TRANSITIONS=37} [2025-03-04 02:13:32,612 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 41 predicate places. [2025-03-04 02:13:32,612 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 248 flow [2025-03-04 02:13:32,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.0625) internal successors, (161), 16 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:32,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:32,613 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:32,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 02:13:32,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 02:13:32,814 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:32,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:32,814 INFO L85 PathProgramCache]: Analyzing trace with hash -504804453, now seen corresponding path program 6 times [2025-03-04 02:13:32,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:32,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516826374] [2025-03-04 02:13:32,815 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:13:32,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:32,831 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 15 equivalence classes. [2025-03-04 02:13:32,839 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 90 statements. [2025-03-04 02:13:32,840 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:13:32,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:32,888 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 02:13:32,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516826374] [2025-03-04 02:13:32,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516826374] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:32,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828664133] [2025-03-04 02:13:32,888 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 02:13:32,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:32,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:32,890 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:32,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 02:13:32,954 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 15 equivalence classes. [2025-03-04 02:13:32,969 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 90 statements. [2025-03-04 02:13:32,970 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-04 02:13:32,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:32,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 02:13:32,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:33,064 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 02:13:33,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-04 02:13:33,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828664133] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:33,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:33,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-04 02:13:33,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864634669] [2025-03-04 02:13:33,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:33,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 02:13:33,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:33,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 02:13:33,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 02:13:33,187 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:13:33,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 37 transitions, 248 flow. Second operand has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:33,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:33,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:13:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:33,509 INFO L124 PetriNetUnfolderBase]: 1213/2833 cut-off events. [2025-03-04 02:13:33,509 INFO L125 PetriNetUnfolderBase]: For 5257/5257 co-relation queries the response was YES. [2025-03-04 02:13:33,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8848 conditions, 2833 events. 1213/2833 cut-off events. For 5257/5257 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 15306 event pairs, 86 based on Foata normal form. 232/3065 useless extension candidates. Maximal degree in co-relation 7860. Up to 495 conditions per place. [2025-03-04 02:13:33,523 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 155 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-03-04 02:13:33,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 169 transitions, 1520 flow [2025-03-04 02:13:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 02:13:33,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 02:13:33,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-03-04 02:13:33,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-04 02:13:33,524 INFO L175 Difference]: Start difference. First operand has 63 places, 37 transitions, 248 flow. Second operand 8 states and 124 transitions. [2025-03-04 02:13:33,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 169 transitions, 1520 flow [2025-03-04 02:13:33,531 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 169 transitions, 1450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:13:33,534 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 296 flow [2025-03-04 02:13:33,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=70, PETRI_TRANSITIONS=41} [2025-03-04 02:13:33,535 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2025-03-04 02:13:33,536 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 296 flow [2025-03-04 02:13:33,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.444444444444445) internal successors, (103), 9 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:33,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:33,536 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:33,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 02:13:33,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:33,737 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:33,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:33,738 INFO L85 PathProgramCache]: Analyzing trace with hash -842331235, now seen corresponding path program 7 times [2025-03-04 02:13:33,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:33,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952323282] [2025-03-04 02:13:33,738 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:13:33,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:33,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 02:13:33,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 02:13:33,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:33,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:33,950 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 02:13:33,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952323282] [2025-03-04 02:13:33,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952323282] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:33,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436758653] [2025-03-04 02:13:33,951 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 02:13:33,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:33,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:33,953 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:33,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 02:13:34,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-04 02:13:34,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-04 02:13:34,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 02:13:34,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:34,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 02:13:34,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:34,137 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 02:13:34,138 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:34,265 INFO L134 CoverageAnalysis]: Checked inductivity of 317 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 02:13:34,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436758653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:34,265 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:34,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-04 02:13:34,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251026515] [2025-03-04 02:13:34,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:34,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 02:13:34,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:34,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 02:13:34,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-04 02:13:34,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:13:34,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 41 transitions, 296 flow. Second operand has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:34,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:34,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:13:34,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:35,043 INFO L124 PetriNetUnfolderBase]: 2601/6155 cut-off events. [2025-03-04 02:13:35,043 INFO L125 PetriNetUnfolderBase]: For 17634/17634 co-relation queries the response was YES. [2025-03-04 02:13:35,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22174 conditions, 6155 events. 2601/6155 cut-off events. For 17634/17634 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 37158 event pairs, 156 based on Foata normal form. 464/6619 useless extension candidates. Maximal degree in co-relation 19749. Up to 1095 conditions per place. [2025-03-04 02:13:35,085 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 331 selfloop transitions, 16 changer transitions 0/353 dead transitions. [2025-03-04 02:13:35,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 353 transitions, 3146 flow [2025-03-04 02:13:35,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 02:13:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 02:13:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 256 transitions. [2025-03-04 02:13:35,089 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 02:13:35,089 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 296 flow. Second operand 16 states and 256 transitions. [2025-03-04 02:13:35,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 353 transitions, 3146 flow [2025-03-04 02:13:35,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 353 transitions, 3094 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-04 02:13:35,115 INFO L231 Difference]: Finished difference. Result has 92 places, 50 transitions, 400 flow [2025-03-04 02:13:35,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=400, PETRI_PLACES=92, PETRI_TRANSITIONS=50} [2025-03-04 02:13:35,116 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 70 predicate places. [2025-03-04 02:13:35,117 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 50 transitions, 400 flow [2025-03-04 02:13:35,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 11.294117647058824) internal successors, (192), 17 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:35,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:35,117 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:35,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 02:13:35,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:35,318 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:35,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:35,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1695858195, now seen corresponding path program 8 times [2025-03-04 02:13:35,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:35,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776676878] [2025-03-04 02:13:35,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:13:35,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:35,340 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 02:13:35,355 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 02:13:35,355 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:13:35,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2025-03-04 02:13:35,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776676878] [2025-03-04 02:13:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776676878] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695660001] [2025-03-04 02:13:35,765 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 02:13:35,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:35,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:35,767 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:35,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 02:13:35,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-04 02:13:35,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 02:13:35,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 02:13:35,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:35,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 02:13:35,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-04 02:13:36,233 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 1028 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 403 trivial. 0 not checked. [2025-03-04 02:13:36,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695660001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:36,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:36,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2025-03-04 02:13:36,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751484656] [2025-03-04 02:13:36,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:36,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-04 02:13:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:36,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-04 02:13:36,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2025-03-04 02:13:36,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:13:36,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 50 transitions, 400 flow. Second operand has 37 states, 37 states have (on average 10.0) internal successors, (370), 37 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:36,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:36,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:13:36,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:48,295 INFO L124 PetriNetUnfolderBase]: 4239/9918 cut-off events. [2025-03-04 02:13:48,296 INFO L125 PetriNetUnfolderBase]: For 78434/78434 co-relation queries the response was YES. [2025-03-04 02:13:48,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39011 conditions, 9918 events. 4239/9918 cut-off events. For 78434/78434 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 62143 event pairs, 8 based on Foata normal form. 499/10417 useless extension candidates. Maximal degree in co-relation 29357. Up to 1751 conditions per place. [2025-03-04 02:13:48,356 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 2350 selfloop transitions, 688 changer transitions 0/3043 dead transitions. [2025-03-04 02:13:48,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3043 transitions, 21274 flow [2025-03-04 02:13:48,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 337 states. [2025-03-04 02:13:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2025-03-04 02:13:48,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 4840 transitions. [2025-03-04 02:13:48,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5984174085064293 [2025-03-04 02:13:48,372 INFO L175 Difference]: Start difference. First operand has 92 places, 50 transitions, 400 flow. Second operand 337 states and 4840 transitions. [2025-03-04 02:13:48,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3043 transitions, 21274 flow [2025-03-04 02:13:48,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 3043 transitions, 21114 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 02:13:48,444 INFO L231 Difference]: Finished difference. Result has 549 places, 729 transitions, 8630 flow [2025-03-04 02:13:48,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=337, PETRI_FLOW=8630, PETRI_PLACES=549, PETRI_TRANSITIONS=729} [2025-03-04 02:13:48,445 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 527 predicate places. [2025-03-04 02:13:48,445 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 729 transitions, 8630 flow [2025-03-04 02:13:48,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 10.0) internal successors, (370), 37 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:48,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:48,446 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:48,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 02:13:48,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 02:13:48,650 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:48,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:48,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1472671717, now seen corresponding path program 9 times [2025-03-04 02:13:48,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:48,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040892197] [2025-03-04 02:13:48,651 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:13:48,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:48,669 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 21 equivalence classes. [2025-03-04 02:13:48,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 160 of 185 statements. [2025-03-04 02:13:48,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-04 02:13:48,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-04 02:13:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040892197] [2025-03-04 02:13:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040892197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2135071170] [2025-03-04 02:13:49,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 02:13:49,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:49,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:49,119 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:49,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 02:13:49,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 21 equivalence classes. [2025-03-04 02:13:49,485 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 160 of 185 statements. [2025-03-04 02:13:49,485 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-04 02:13:49,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:49,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 02:13:49,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:49,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-04 02:13:49,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1510 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2025-03-04 02:13:49,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2135071170] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:49,896 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:49,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2025-03-04 02:13:49,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530044734] [2025-03-04 02:13:49,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:49,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:13:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:49,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:13:49,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:13:49,914 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:13:49,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 729 transitions, 8630 flow. Second operand has 23 states, 23 states have (on average 10.217391304347826) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:49,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:49,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:13:49,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:13:53,526 INFO L124 PetriNetUnfolderBase]: 5329/12507 cut-off events. [2025-03-04 02:13:53,526 INFO L125 PetriNetUnfolderBase]: For 968098/968098 co-relation queries the response was YES. [2025-03-04 02:13:53,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67187 conditions, 12507 events. 5329/12507 cut-off events. For 968098/968098 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 82493 event pairs, 298 based on Foata normal form. 415/12904 useless extension candidates. Maximal degree in co-relation 62467. Up to 2163 conditions per place. [2025-03-04 02:13:53,683 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 610 selfloop transitions, 442 changer transitions 0/1073 dead transitions. [2025-03-04 02:13:53,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1073 transitions, 17850 flow [2025-03-04 02:13:53,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 02:13:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-04 02:13:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 348 transitions. [2025-03-04 02:13:53,685 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2025-03-04 02:13:53,685 INFO L175 Difference]: Start difference. First operand has 549 places, 729 transitions, 8630 flow. Second operand 22 states and 348 transitions. [2025-03-04 02:13:53,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 1073 transitions, 17850 flow [2025-03-04 02:13:55,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 1073 transitions, 16758 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-04 02:13:55,648 INFO L231 Difference]: Finished difference. Result has 550 places, 814 transitions, 9836 flow [2025-03-04 02:13:55,649 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=7668, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=357, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=9836, PETRI_PLACES=550, PETRI_TRANSITIONS=814} [2025-03-04 02:13:55,649 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 528 predicate places. [2025-03-04 02:13:55,649 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 814 transitions, 9836 flow [2025-03-04 02:13:55,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 10.217391304347826) internal successors, (235), 23 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:55,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:13:55,650 INFO L206 CegarLoopForPetriNet]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:13:55,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 02:13:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:55,850 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:13:55,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:13:55,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1569240641, now seen corresponding path program 10 times [2025-03-04 02:13:55,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:13:55,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640267975] [2025-03-04 02:13:55,852 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:13:55,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:13:55,874 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-04 02:13:55,916 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 02:13:55,919 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:13:55,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:57,930 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:13:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640267975] [2025-03-04 02:13:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640267975] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 02:13:57,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435827004] [2025-03-04 02:13:57,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 02:13:57,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:13:57,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 02:13:57,933 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 02:13:57,935 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 02:13:58,028 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-04 02:13:58,137 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-04 02:13:58,137 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 02:13:58,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:13:58,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-04 02:13:58,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 02:13:58,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:58,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 02:13:58,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 02:13:58,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435827004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 02:13:58,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 02:13:58,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 44 [2025-03-04 02:13:58,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713298170] [2025-03-04 02:13:58,590 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 02:13:58,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-04 02:13:58,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:13:58,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-04 02:13:58,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2025-03-04 02:13:58,609 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-04 02:13:58,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 814 transitions, 9836 flow. Second operand has 45 states, 45 states have (on average 8.777777777777779) internal successors, (395), 45 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:13:58,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:13:58,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-04 02:13:58,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:10,131 INFO L124 PetriNetUnfolderBase]: 8401/22289 cut-off events. [2025-03-04 02:14:10,132 INFO L125 PetriNetUnfolderBase]: For 6053790/6053810 co-relation queries the response was YES. [2025-03-04 02:14:10,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213781 conditions, 22289 events. 8401/22289 cut-off events. For 6053790/6053810 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 177014 event pairs, 1183 based on Foata normal form. 1/22254 useless extension candidates. Maximal degree in co-relation 205016. Up to 4068 conditions per place. [2025-03-04 02:14:10,702 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 2983 selfloop transitions, 83 changer transitions 2/3093 dead transitions. [2025-03-04 02:14:10,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 3093 transitions, 46093 flow [2025-03-04 02:14:10,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 02:14:10,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 02:14:10,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 666 transitions. [2025-03-04 02:14:10,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-03-04 02:14:10,704 INFO L175 Difference]: Start difference. First operand has 550 places, 814 transitions, 9836 flow. Second operand 44 states and 666 transitions. [2025-03-04 02:14:10,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 3093 transitions, 46093 flow [2025-03-04 02:14:51,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 3093 transitions, 44023 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-04 02:14:51,773 INFO L231 Difference]: Finished difference. Result has 580 places, 896 transitions, 9548 flow [2025-03-04 02:14:51,774 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=24, PETRI_DIFFERENCE_MINUEND_FLOW=9206, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=814, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=811, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=9548, PETRI_PLACES=580, PETRI_TRANSITIONS=896} [2025-03-04 02:14:51,775 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 558 predicate places. [2025-03-04 02:14:51,775 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 896 transitions, 9548 flow [2025-03-04 02:14:51,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 8.777777777777779) internal successors, (395), 45 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:14:51,775 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 02:14:51,776 INFO L206 CegarLoopForPetriNet]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 02:14:51,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 02:14:51,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 02:14:51,976 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-04 02:14:51,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 02:14:51,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1104514545, now seen corresponding path program 11 times [2025-03-04 02:14:51,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 02:14:51,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766886065] [2025-03-04 02:14:51,978 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 02:14:51,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 02:14:52,000 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 215 statements into 23 equivalence classes. [2025-03-04 02:14:52,067 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 215 of 215 statements. [2025-03-04 02:14:52,067 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-04 02:14:52,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 02:14:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 1410 proven. 0 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2025-03-04 02:14:52,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 02:14:52,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766886065] [2025-03-04 02:14:52,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766886065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 02:14:52,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 02:14:52,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-04 02:14:52,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018455012] [2025-03-04 02:14:52,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 02:14:52,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 02:14:52,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 02:14:52,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 02:14:52,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-04 02:14:52,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-04 02:14:52,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 896 transitions, 9548 flow. Second operand has 23 states, 23 states have (on average 11.043478260869565) internal successors, (254), 23 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 02:14:52,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 02:14:52,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-04 02:14:52,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 02:14:58,850 INFO L124 PetriNetUnfolderBase]: 7950/18715 cut-off events. [2025-03-04 02:14:58,851 INFO L125 PetriNetUnfolderBase]: For 831603/831711 co-relation queries the response was YES. [2025-03-04 02:14:59,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102031 conditions, 18715 events. 7950/18715 cut-off events. For 831603/831711 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 137391 event pairs, 208 based on Foata normal form. 175/18854 useless extension candidates. Maximal degree in co-relation 101858. Up to 3296 conditions per place. [2025-03-04 02:14:59,216 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 1935 selfloop transitions, 336 changer transitions 0/2278 dead transitions. [2025-03-04 02:14:59,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 2278 transitions, 19852 flow [2025-03-04 02:14:59,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 02:14:59,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 02:14:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 355 transitions. [2025-03-04 02:14:59,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6431159420289855 [2025-03-04 02:14:59,217 INFO L175 Difference]: Start difference. First operand has 580 places, 896 transitions, 9548 flow. Second operand 23 states and 355 transitions. [2025-03-04 02:14:59,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 2278 transitions, 19852 flow