./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 e2fb8bed 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-?-e2fb8be-m [2025-03-08 17:24:20,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 17:24:20,117 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 17:24:20,122 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 17:24:20,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 17:24:20,141 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 17:24:20,142 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 17:24:20,142 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 17:24:20,142 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 17:24:20,142 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 17:24:20,143 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 17:24:20,143 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 17:24:20,143 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 17:24:20,143 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 17:24:20,144 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 17:24:20,144 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 17:24:20,145 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 17:24:20,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:24:20,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 17:24:20,146 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 17:24:20,146 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-08 17:24:20,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 17:24:20,394 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 17:24:20,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 17:24:20,397 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 17:24:20,397 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 17:24:20,398 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-08 17:24:21,596 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e99fa3b/56930f174f5748c5bf15a08ea5329422/FLAGe5c00f79e [2025-03-08 17:24:21,898 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 17:24:21,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-08 17:24:21,917 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e99fa3b/56930f174f5748c5bf15a08ea5329422/FLAGe5c00f79e [2025-03-08 17:24:21,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69e99fa3b/56930f174f5748c5bf15a08ea5329422 [2025-03-08 17:24:21,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 17:24:21,935 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 17:24:21,936 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 17:24:21,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 17:24:21,940 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 17:24:21,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:24:21" (1/1) ... [2025-03-08 17:24:21,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de29ef5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:21, skipping insertion in model container [2025-03-08 17:24:21,942 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:24:21" (1/1) ... [2025-03-08 17:24:21,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 17:24:22,105 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-08 17:24:22,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:24:22,338 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 17:24:22,345 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-08 17:24:22,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 17:24:22,437 INFO L204 MainTranslator]: Completed translation [2025-03-08 17:24:22,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22 WrapperNode [2025-03-08 17:24:22,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 17:24:22,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 17:24:22,440 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 17:24:22,440 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 17:24:22,444 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,456 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,467 INFO L138 Inliner]: procedures = 364, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 60 [2025-03-08 17:24:22,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 17:24:22,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 17:24:22,468 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 17:24:22,468 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 17:24:22,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,478 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,479 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,493 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-08 17:24:22,494 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,494 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,497 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,500 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 17:24:22,501 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 17:24:22,503 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 17:24:22,503 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 17:24:22,504 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (1/1) ... [2025-03-08 17:24:22,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 17:24:22,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:22,529 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-08 17:24:22,532 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-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-08 17:24:22,549 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 17:24:22,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 17:24:22,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 17:24:22,550 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 17:24:22,651 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 17:24:22,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 17:24:22,790 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 17:24:22,790 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 17:24:22,866 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 17:24:22,867 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 17:24:22,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:24:22 BoogieIcfgContainer [2025-03-08 17:24:22,867 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 17:24:22,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 17:24:22,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 17:24:22,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 17:24:22,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:24:21" (1/3) ... [2025-03-08 17:24:22,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e56e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:24:22, skipping insertion in model container [2025-03-08 17:24:22,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:24:22" (2/3) ... [2025-03-08 17:24:22,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@665e56e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:24:22, skipping insertion in model container [2025-03-08 17:24:22,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:24:22" (3/3) ... [2025-03-08 17:24:22,875 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-08 17:24:22,886 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 17:24:22,887 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-08 17:24:22,889 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 17:24:22,926 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 17:24:22,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 25 places, 24 transitions, 55 flow [2025-03-08 17:24:22,968 INFO L124 PetriNetUnfolderBase]: 3/23 cut-off events. [2025-03-08 17:24:22,972 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:24:22,976 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-08 17:24:22,976 INFO L82 GeneralOperation]: Start removeDead. Operand has 25 places, 24 transitions, 55 flow [2025-03-08 17:24:22,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 22 places, 20 transitions, 46 flow [2025-03-08 17:24:22,984 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 17:24:22,995 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;@5624c38c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 17:24:22,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 17:24:23,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 17:24:23,005 INFO L124 PetriNetUnfolderBase]: 2/19 cut-off events. [2025-03-08 17:24:23,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:24:23,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:23,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:24:23,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:23,010 INFO L85 PathProgramCache]: Analyzing trace with hash 586663073, now seen corresponding path program 1 times [2025-03-08 17:24:23,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:23,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939366405] [2025-03-08 17:24:23,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:24:23,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:23,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-08 17:24:23,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-08 17:24:23,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:24:23,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:23,188 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-08 17:24:23,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:23,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939366405] [2025-03-08 17:24:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939366405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:24:23,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:24:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:24:23,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206076729] [2025-03-08 17:24:23,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:24:23,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:24:23,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:23,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:24:23,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:24:23,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-08 17:24:23,220 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-08 17:24:23,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:23,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-08 17:24:23,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:23,287 INFO L124 PetriNetUnfolderBase]: 61/134 cut-off events. [2025-03-08 17:24:23,287 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 17:24:23,288 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-08 17:24:23,289 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2025-03-08 17:24:23,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 30 transitions, 118 flow [2025-03-08 17:24:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:24:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:24:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-08 17:24:23,300 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-08 17:24:23,301 INFO L175 Difference]: Start difference. First operand has 22 places, 20 transitions, 46 flow. Second operand 3 states and 45 transitions. [2025-03-08 17:24:23,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 30 transitions, 118 flow [2025-03-08 17:24:23,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 22 places, 30 transitions, 114 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 17:24:23,308 INFO L231 Difference]: Finished difference. Result has 23 places, 21 transitions, 54 flow [2025-03-08 17:24:23,309 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-08 17:24:23,313 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 1 predicate places. [2025-03-08 17:24:23,314 INFO L471 AbstractCegarLoop]: Abstraction has has 23 places, 21 transitions, 54 flow [2025-03-08 17:24:23,314 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-08 17:24:23,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:23,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 17:24:23,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 17:24:23,314 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:23,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:23,315 INFO L85 PathProgramCache]: Analyzing trace with hash 64502193, now seen corresponding path program 1 times [2025-03-08 17:24:23,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:23,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403010792] [2025-03-08 17:24:23,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:24:23,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:23,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 17:24:23,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 17:24:23,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:24:23,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:23,392 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-08 17:24:23,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:23,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403010792] [2025-03-08 17:24:23,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403010792] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:24:23,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:24:23,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:24:23,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077821418] [2025-03-08 17:24:23,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:24:23,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:24:23,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:23,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:24:23,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:24:23,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-08 17:24:23,397 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-08 17:24:23,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:23,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-08 17:24:23,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:23,484 INFO L124 PetriNetUnfolderBase]: 91/207 cut-off events. [2025-03-08 17:24:23,484 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-08 17:24:23,488 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-08 17:24:23,489 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 24 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-03-08 17:24:23,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 31 transitions, 134 flow [2025-03-08 17:24:23,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:24:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:24:23,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2025-03-08 17:24:23,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6388888888888888 [2025-03-08 17:24:23,491 INFO L175 Difference]: Start difference. First operand has 23 places, 21 transitions, 54 flow. Second operand 3 states and 46 transitions. [2025-03-08 17:24:23,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 31 transitions, 134 flow [2025-03-08 17:24:23,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:24:23,492 INFO L231 Difference]: Finished difference. Result has 25 places, 22 transitions, 64 flow [2025-03-08 17:24:23,492 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-08 17:24:23,492 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 3 predicate places. [2025-03-08 17:24:23,492 INFO L471 AbstractCegarLoop]: Abstraction has has 25 places, 22 transitions, 64 flow [2025-03-08 17:24:23,493 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-08 17:24:23,493 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:23,493 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-08 17:24:23,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 17:24:23,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:23,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash -832312549, now seen corresponding path program 1 times [2025-03-08 17:24:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:23,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288609839] [2025-03-08 17:24:23,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 17:24:23,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:23,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:24:23,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:24:23,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:24:23,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:23,647 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-08 17:24:23,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:23,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288609839] [2025-03-08 17:24:23,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288609839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:24:23,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:24:23,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 17:24:23,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146061787] [2025-03-08 17:24:23,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:24:23,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 17:24:23,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:23,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 17:24:23,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 17:24:23,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-08 17:24:23,649 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-08 17:24:23,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:23,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-08 17:24:23,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:23,707 INFO L124 PetriNetUnfolderBase]: 59/153 cut-off events. [2025-03-08 17:24:23,707 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-08 17:24:23,708 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-08 17:24:23,710 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 20 selfloop transitions, 4 changer transitions 0/29 dead transitions. [2025-03-08 17:24:23,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 29 transitions, 142 flow [2025-03-08 17:24:23,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 17:24:23,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 17:24:23,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-08 17:24:23,711 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5972222222222222 [2025-03-08 17:24:23,711 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 64 flow. Second operand 3 states and 43 transitions. [2025-03-08 17:24:23,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 29 transitions, 142 flow [2025-03-08 17:24:23,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 29 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:24:23,712 INFO L231 Difference]: Finished difference. Result has 26 places, 22 transitions, 70 flow [2025-03-08 17:24:23,712 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-08 17:24:23,713 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 4 predicate places. [2025-03-08 17:24:23,713 INFO L471 AbstractCegarLoop]: Abstraction has has 26 places, 22 transitions, 70 flow [2025-03-08 17:24:23,713 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-08 17:24:23,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:23,713 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-08 17:24:23,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 17:24:23,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:23,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:23,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1991320131, now seen corresponding path program 2 times [2025-03-08 17:24:23,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:23,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605617405] [2025-03-08 17:24:23,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:24:23,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:23,721 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 1 equivalence classes. [2025-03-08 17:24:23,728 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 17:24:23,728 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 17:24:23,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:23,777 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-08 17:24:23,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:23,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605617405] [2025-03-08 17:24:23,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605617405] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:24:23,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:24:23,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:24:23,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574746335] [2025-03-08 17:24:23,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:24:23,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:24:23,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:23,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:24:23,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:24:23,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 24 [2025-03-08 17:24:23,787 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-08 17:24:23,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:23,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 24 [2025-03-08 17:24:23,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:23,873 INFO L124 PetriNetUnfolderBase]: 79/214 cut-off events. [2025-03-08 17:24:23,875 INFO L125 PetriNetUnfolderBase]: For 94/94 co-relation queries the response was YES. [2025-03-08 17:24:23,877 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-08 17:24:23,879 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 33 selfloop transitions, 3 changer transitions 0/41 dead transitions. [2025-03-08 17:24:23,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 210 flow [2025-03-08 17:24:23,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:24:23,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:24:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2025-03-08 17:24:23,880 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-08 17:24:23,880 INFO L175 Difference]: Start difference. First operand has 26 places, 22 transitions, 70 flow. Second operand 4 states and 62 transitions. [2025-03-08 17:24:23,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 210 flow [2025-03-08 17:24:23,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 198 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 17:24:23,882 INFO L231 Difference]: Finished difference. Result has 29 places, 23 transitions, 82 flow [2025-03-08 17:24:23,883 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-08 17:24:23,883 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 7 predicate places. [2025-03-08 17:24:23,884 INFO L471 AbstractCegarLoop]: Abstraction has has 29 places, 23 transitions, 82 flow [2025-03-08 17:24:23,884 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-08 17:24:23,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:23,884 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-08 17:24:23,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 17:24:23,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:23,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash 2063330419, now seen corresponding path program 3 times [2025-03-08 17:24:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:23,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910996682] [2025-03-08 17:24:23,886 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:24:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:23,896 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-03-08 17:24:23,901 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 15 of 25 statements. [2025-03-08 17:24:23,902 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-08 17:24:23,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:23,940 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-08 17:24:23,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:23,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910996682] [2025-03-08 17:24:23,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910996682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:24:23,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:24:23,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 17:24:23,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789277728] [2025-03-08 17:24:23,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:24:23,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 17:24:23,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:23,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 17:24:23,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 17:24:23,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-08 17:24:23,948 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-08 17:24:23,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:23,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-08 17:24:23,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:24,018 INFO L124 PetriNetUnfolderBase]: 125/328 cut-off events. [2025-03-08 17:24:24,019 INFO L125 PetriNetUnfolderBase]: For 308/308 co-relation queries the response was YES. [2025-03-08 17:24:24,019 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-08 17:24:24,020 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 39 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2025-03-08 17:24:24,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 46 transitions, 266 flow [2025-03-08 17:24:24,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 17:24:24,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-08 17:24:24,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2025-03-08 17:24:24,021 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6354166666666666 [2025-03-08 17:24:24,022 INFO L175 Difference]: Start difference. First operand has 29 places, 23 transitions, 82 flow. Second operand 4 states and 61 transitions. [2025-03-08 17:24:24,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 46 transitions, 266 flow [2025-03-08 17:24:24,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 46 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-08 17:24:24,023 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 92 flow [2025-03-08 17:24:24,023 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-08 17:24:24,024 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 9 predicate places. [2025-03-08 17:24:24,024 INFO L471 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 92 flow [2025-03-08 17:24:24,024 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-08 17:24:24,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:24,024 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-08 17:24:24,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 17:24:24,026 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:24,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:24,026 INFO L85 PathProgramCache]: Analyzing trace with hash 758716615, now seen corresponding path program 4 times [2025-03-08 17:24:24,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:24,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281920268] [2025-03-08 17:24:24,026 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:24:24,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:24,039 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 17:24:24,051 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:24:24,051 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:24:24,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:24,103 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-08 17:24:24,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:24,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281920268] [2025-03-08 17:24:24,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281920268] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:24,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451543455] [2025-03-08 17:24:24,104 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:24:24,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:24,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:24,107 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-08 17:24:24,108 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-08 17:24:24,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 30 statements into 2 equivalence classes. [2025-03-08 17:24:24,171 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 17:24:24,171 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:24:24,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:24,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:24:24,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:24,263 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-08 17:24:24,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:24,322 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-08 17:24:24,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451543455] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:24,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:24,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-08 17:24:24,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625604122] [2025-03-08 17:24:24,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:24,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 17:24:24,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:24,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 17:24:24,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-03-08 17:24:24,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-08 17:24:24,327 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-08 17:24:24,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:24,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-08 17:24:24,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:24,475 INFO L124 PetriNetUnfolderBase]: 319/729 cut-off events. [2025-03-08 17:24:24,475 INFO L125 PetriNetUnfolderBase]: For 645/645 co-relation queries the response was YES. [2025-03-08 17:24:24,477 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-08 17:24:24,480 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 85 selfloop transitions, 8 changer transitions 0/96 dead transitions. [2025-03-08 17:24:24,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 96 transitions, 552 flow [2025-03-08 17:24:24,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:24:24,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:24:24,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-03-08 17:24:24,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-08 17:24:24,482 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 92 flow. Second operand 8 states and 123 transitions. [2025-03-08 17:24:24,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 96 transitions, 552 flow [2025-03-08 17:24:24,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 96 transitions, 546 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-08 17:24:24,484 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 144 flow [2025-03-08 17:24:24,484 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-08 17:24:24,485 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 19 predicate places. [2025-03-08 17:24:24,485 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 144 flow [2025-03-08 17:24:24,485 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-08 17:24:24,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:24,485 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-08 17:24:24,492 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-08 17:24:24,689 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-08 17:24:24,690 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash 700427721, now seen corresponding path program 5 times [2025-03-08 17:24:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741416793] [2025-03-08 17:24:24,691 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:24:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:24,701 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-03-08 17:24:24,716 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:24:24,716 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 17:24:24,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:24,848 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-08 17:24:24,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741416793] [2025-03-08 17:24:24,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741416793] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:24,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179539086] [2025-03-08 17:24:24,849 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:24:24,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:24,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:24,851 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-08 17:24:24,853 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-08 17:24:24,899 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 50 statements into 6 equivalence classes. [2025-03-08 17:24:24,927 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 17:24:24,927 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-03-08 17:24:24,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:24,928 INFO L256 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:24:24,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:24,998 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-08 17:24:24,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:25,128 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-08 17:24:25,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179539086] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:25,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-03-08 17:24:25,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384589010] [2025-03-08 17:24:25,129 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 17:24:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:25,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 17:24:25,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-03-08 17:24:25,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-08 17:24:25,144 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-08 17:24:25,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:25,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-08 17:24:25,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:25,494 INFO L124 PetriNetUnfolderBase]: 687/1551 cut-off events. [2025-03-08 17:24:25,494 INFO L125 PetriNetUnfolderBase]: For 2946/2946 co-relation queries the response was YES. [2025-03-08 17:24:25,499 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-08 17:24:25,504 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 181 selfloop transitions, 16 changer transitions 0/200 dead transitions. [2025-03-08 17:24:25,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 200 transitions, 1266 flow [2025-03-08 17:24:25,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 17:24:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 17:24:25,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 255 transitions. [2025-03-08 17:24:25,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2025-03-08 17:24:25,507 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 144 flow. Second operand 16 states and 255 transitions. [2025-03-08 17:24:25,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 200 transitions, 1266 flow [2025-03-08 17:24:25,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 200 transitions, 1214 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-08 17:24:25,517 INFO L231 Difference]: Finished difference. Result has 63 places, 37 transitions, 248 flow [2025-03-08 17:24:25,517 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-08 17:24:25,518 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 41 predicate places. [2025-03-08 17:24:25,518 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 37 transitions, 248 flow [2025-03-08 17:24:25,518 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-08 17:24:25,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:25,518 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-08 17:24:25,524 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-08 17:24:25,723 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-08 17:24:25,723 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:25,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:25,724 INFO L85 PathProgramCache]: Analyzing trace with hash -504804453, now seen corresponding path program 6 times [2025-03-08 17:24:25,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:25,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678149959] [2025-03-08 17:24:25,724 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:24:25,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:25,742 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 15 equivalence classes. [2025-03-08 17:24:25,747 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 90 statements. [2025-03-08 17:24:25,748 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 17:24:25,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:25,794 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-08 17:24:25,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678149959] [2025-03-08 17:24:25,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678149959] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:25,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054405785] [2025-03-08 17:24:25,794 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 17:24:25,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:25,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:25,798 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-08 17:24:25,799 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-08 17:24:25,855 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 90 statements into 15 equivalence classes. [2025-03-08 17:24:25,872 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 30 of 90 statements. [2025-03-08 17:24:25,872 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-03-08 17:24:25,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:25,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 17:24:25,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:25,992 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-08 17:24:25,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:26,094 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-08 17:24:26,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054405785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:26,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:26,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 17:24:26,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334844858] [2025-03-08 17:24:26,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:26,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 17:24:26,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:26,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 17:24:26,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-08 17:24:26,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-08 17:24:26,103 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-08 17:24:26,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:26,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-08 17:24:26,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:26,433 INFO L124 PetriNetUnfolderBase]: 1213/2833 cut-off events. [2025-03-08 17:24:26,433 INFO L125 PetriNetUnfolderBase]: For 5257/5257 co-relation queries the response was YES. [2025-03-08 17:24:26,440 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-08 17:24:26,448 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 155 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-03-08 17:24:26,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 169 transitions, 1520 flow [2025-03-08 17:24:26,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 17:24:26,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-08 17:24:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 124 transitions. [2025-03-08 17:24:26,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6458333333333334 [2025-03-08 17:24:26,449 INFO L175 Difference]: Start difference. First operand has 63 places, 37 transitions, 248 flow. Second operand 8 states and 124 transitions. [2025-03-08 17:24:26,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 169 transitions, 1520 flow [2025-03-08 17:24:26,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 169 transitions, 1450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 17:24:26,457 INFO L231 Difference]: Finished difference. Result has 70 places, 41 transitions, 296 flow [2025-03-08 17:24:26,457 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-08 17:24:26,457 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 48 predicate places. [2025-03-08 17:24:26,457 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 41 transitions, 296 flow [2025-03-08 17:24:26,457 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-08 17:24:26,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:26,457 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-08 17:24:26,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 17:24:26,658 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-08 17:24:26,658 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:26,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:26,659 INFO L85 PathProgramCache]: Analyzing trace with hash -842331235, now seen corresponding path program 7 times [2025-03-08 17:24:26,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:26,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383994804] [2025-03-08 17:24:26,659 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:24:26,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:26,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 17:24:26,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 17:24:26,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:24:26,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:26,862 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-08 17:24:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383994804] [2025-03-08 17:24:26,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383994804] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:26,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1748236914] [2025-03-08 17:24:26,862 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 17:24:26,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:26,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:26,864 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-08 17:24:26,872 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-08 17:24:26,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 17:24:26,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 17:24:26,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 17:24:26,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:26,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 17:24:26,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:27,050 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-08 17:24:27,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:27,190 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-08 17:24:27,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1748236914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:27,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:27,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-03-08 17:24:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835937816] [2025-03-08 17:24:27,191 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:27,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 17:24:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:27,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 17:24:27,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2025-03-08 17:24:27,202 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-08 17:24:27,203 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-08 17:24:27,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:27,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-08 17:24:27,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:27,970 INFO L124 PetriNetUnfolderBase]: 2601/6155 cut-off events. [2025-03-08 17:24:27,970 INFO L125 PetriNetUnfolderBase]: For 17634/17634 co-relation queries the response was YES. [2025-03-08 17:24:27,982 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-08 17:24:28,003 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 331 selfloop transitions, 16 changer transitions 0/353 dead transitions. [2025-03-08 17:24:28,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 353 transitions, 3146 flow [2025-03-08 17:24:28,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-08 17:24:28,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-08 17:24:28,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 256 transitions. [2025-03-08 17:24:28,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-08 17:24:28,005 INFO L175 Difference]: Start difference. First operand has 70 places, 41 transitions, 296 flow. Second operand 16 states and 256 transitions. [2025-03-08 17:24:28,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 353 transitions, 3146 flow [2025-03-08 17:24:28,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 353 transitions, 3094 flow, removed 24 selfloop flow, removed 2 redundant places. [2025-03-08 17:24:28,028 INFO L231 Difference]: Finished difference. Result has 92 places, 50 transitions, 400 flow [2025-03-08 17:24:28,028 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-08 17:24:28,029 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 70 predicate places. [2025-03-08 17:24:28,029 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 50 transitions, 400 flow [2025-03-08 17:24:28,029 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-08 17:24:28,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:28,029 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-08 17:24:28,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 17:24:28,232 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-08 17:24:28,232 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:28,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1695858195, now seen corresponding path program 8 times [2025-03-08 17:24:28,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:28,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048211762] [2025-03-08 17:24:28,233 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:24:28,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:28,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-08 17:24:28,270 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 17:24:28,270 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:24:28,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:28,667 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-08 17:24:28,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:28,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048211762] [2025-03-08 17:24:28,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048211762] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:28,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581416445] [2025-03-08 17:24:28,667 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 17:24:28,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:28,669 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-08 17:24:28,671 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-08 17:24:28,744 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 150 statements into 2 equivalence classes. [2025-03-08 17:24:28,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 17:24:28,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 17:24:28,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:28,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 17:24:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:29,168 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-08 17:24:29,168 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:29,536 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-08 17:24:29,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581416445] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:29,537 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:29,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 37 [2025-03-08 17:24:29,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779698893] [2025-03-08 17:24:29,537 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:29,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-08 17:24:29,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:29,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-08 17:24:29,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 17:24:29,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-08 17:24:29,563 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-08 17:24:29,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:29,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-08 17:24:29,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:41,111 INFO L124 PetriNetUnfolderBase]: 4239/9918 cut-off events. [2025-03-08 17:24:41,111 INFO L125 PetriNetUnfolderBase]: For 78434/78434 co-relation queries the response was YES. [2025-03-08 17:24:41,135 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-08 17:24:41,169 INFO L140 encePairwiseOnDemand]: 17/24 looper letters, 2350 selfloop transitions, 688 changer transitions 0/3043 dead transitions. [2025-03-08 17:24:41,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 3043 transitions, 21274 flow [2025-03-08 17:24:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 337 states. [2025-03-08 17:24:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2025-03-08 17:24:41,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 4840 transitions. [2025-03-08 17:24:41,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5984174085064293 [2025-03-08 17:24:41,182 INFO L175 Difference]: Start difference. First operand has 92 places, 50 transitions, 400 flow. Second operand 337 states and 4840 transitions. [2025-03-08 17:24:41,182 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 3043 transitions, 21274 flow [2025-03-08 17:24:41,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 423 places, 3043 transitions, 21114 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 17:24:41,263 INFO L231 Difference]: Finished difference. Result has 549 places, 729 transitions, 8630 flow [2025-03-08 17:24:41,263 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-08 17:24:41,264 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 527 predicate places. [2025-03-08 17:24:41,266 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 729 transitions, 8630 flow [2025-03-08 17:24:41,266 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-08 17:24:41,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:41,266 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-08 17:24:41,273 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-08 17:24:41,466 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-08 17:24:41,467 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:41,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:41,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1472671717, now seen corresponding path program 9 times [2025-03-08 17:24:41,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:41,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126494650] [2025-03-08 17:24:41,468 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:24:41,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:41,491 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 21 equivalence classes. [2025-03-08 17:24:41,554 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 160 of 185 statements. [2025-03-08 17:24:41,554 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-08 17:24:41,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:41,952 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-08 17:24:41,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126494650] [2025-03-08 17:24:41,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126494650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:41,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054650545] [2025-03-08 17:24:41,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 17:24:41,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:41,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:41,955 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-08 17:24:41,956 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-08 17:24:42,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 185 statements into 21 equivalence classes. [2025-03-08 17:24:42,302 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) and asserted 160 of 185 statements. [2025-03-08 17:24:42,302 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2025-03-08 17:24:42,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:42,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 678 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-08 17:24:42,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:42,440 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-08 17:24:42,440 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:42,685 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-08 17:24:42,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054650545] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:42,685 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:42,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 23 [2025-03-08 17:24:42,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962591523] [2025-03-08 17:24:42,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:42,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 17:24:42,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:42,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 17:24:42,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-08 17:24:42,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-08 17:24:42,711 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-08 17:24:42,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:42,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-08 17:24:42,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:24:46,289 INFO L124 PetriNetUnfolderBase]: 5329/12507 cut-off events. [2025-03-08 17:24:46,289 INFO L125 PetriNetUnfolderBase]: For 968098/968098 co-relation queries the response was YES. [2025-03-08 17:24:46,394 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-08 17:24:46,429 INFO L140 encePairwiseOnDemand]: 20/24 looper letters, 610 selfloop transitions, 442 changer transitions 0/1073 dead transitions. [2025-03-08 17:24:46,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 1073 transitions, 17850 flow [2025-03-08 17:24:46,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-08 17:24:46,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-03-08 17:24:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 348 transitions. [2025-03-08 17:24:46,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6590909090909091 [2025-03-08 17:24:46,431 INFO L175 Difference]: Start difference. First operand has 549 places, 729 transitions, 8630 flow. Second operand 22 states and 348 transitions. [2025-03-08 17:24:46,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 1073 transitions, 17850 flow [2025-03-08 17:24:48,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 1073 transitions, 16758 flow, removed 0 selfloop flow, removed 26 redundant places. [2025-03-08 17:24:48,261 INFO L231 Difference]: Finished difference. Result has 550 places, 814 transitions, 9836 flow [2025-03-08 17:24:48,261 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-08 17:24:48,262 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 528 predicate places. [2025-03-08 17:24:48,262 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 814 transitions, 9836 flow [2025-03-08 17:24:48,262 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-08 17:24:48,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:24:48,263 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-08 17:24:48,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 17:24:48,464 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-08 17:24:48,464 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:24:48,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:24:48,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1569240641, now seen corresponding path program 10 times [2025-03-08 17:24:48,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:24:48,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111512636] [2025-03-08 17:24:48,466 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:24:48,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:24:48,485 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-08 17:24:48,530 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 17:24:48,530 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:24:48,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:50,925 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-08 17:24:50,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:24:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111512636] [2025-03-08 17:24:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111512636] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 17:24:50,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597972206] [2025-03-08 17:24:50,926 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 17:24:50,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 17:24:50,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 17:24:50,929 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-08 17:24:50,932 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-08 17:24:51,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 210 statements into 2 equivalence classes. [2025-03-08 17:24:51,157 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 210 of 210 statements. [2025-03-08 17:24:51,157 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 17:24:51,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:24:51,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-03-08 17:24:51,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 17:24:51,396 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-08 17:24:51,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 17:24:51,627 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-08 17:24:51,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597972206] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 17:24:51,627 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 17:24:51,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43, 43] total 44 [2025-03-08 17:24:51,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589149106] [2025-03-08 17:24:51,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 17:24:51,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-08 17:24:51,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:24:51,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-08 17:24:51,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1892, Unknown=0, NotChecked=0, Total=1980 [2025-03-08 17:24:51,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 24 [2025-03-08 17:24:51,651 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-08 17:24:51,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:24:51,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 24 [2025-03-08 17:24:51,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:03,309 INFO L124 PetriNetUnfolderBase]: 8401/22289 cut-off events. [2025-03-08 17:25:03,310 INFO L125 PetriNetUnfolderBase]: For 6053790/6053810 co-relation queries the response was YES. [2025-03-08 17:25:03,847 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-08 17:25:03,943 INFO L140 encePairwiseOnDemand]: 19/24 looper letters, 2983 selfloop transitions, 83 changer transitions 2/3093 dead transitions. [2025-03-08 17:25:03,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 593 places, 3093 transitions, 46093 flow [2025-03-08 17:25:03,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-08 17:25:03,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-08 17:25:03,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 666 transitions. [2025-03-08 17:25:03,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306818181818182 [2025-03-08 17:25:03,945 INFO L175 Difference]: Start difference. First operand has 550 places, 814 transitions, 9836 flow. Second operand 44 states and 666 transitions. [2025-03-08 17:25:03,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 593 places, 3093 transitions, 46093 flow [2025-03-08 17:25:44,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 3093 transitions, 44023 flow, removed 0 selfloop flow, removed 15 redundant places. [2025-03-08 17:25:44,883 INFO L231 Difference]: Finished difference. Result has 580 places, 896 transitions, 9548 flow [2025-03-08 17:25:44,884 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-08 17:25:44,884 INFO L279 CegarLoopForPetriNet]: 22 programPoint places, 558 predicate places. [2025-03-08 17:25:44,884 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 896 transitions, 9548 flow [2025-03-08 17:25:44,885 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-08 17:25:44,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 17:25:44,885 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-08 17:25:44,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 17:25:45,085 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-08 17:25:45,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-03-08 17:25:45,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 17:25:45,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1104514545, now seen corresponding path program 11 times [2025-03-08 17:25:45,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 17:25:45,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799714907] [2025-03-08 17:25:45,088 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 17:25:45,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 17:25:45,110 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 215 statements into 23 equivalence classes. [2025-03-08 17:25:45,175 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 215 of 215 statements. [2025-03-08 17:25:45,175 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-08 17:25:45,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 17:25:45,629 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-08 17:25:45,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 17:25:45,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799714907] [2025-03-08 17:25:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799714907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 17:25:45,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 17:25:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2025-03-08 17:25:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711266084] [2025-03-08 17:25:45,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 17:25:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-08 17:25:45,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 17:25:45,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-08 17:25:45,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-03-08 17:25:45,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 24 [2025-03-08 17:25:45,645 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-08 17:25:45,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 17:25:45,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 24 [2025-03-08 17:25:45,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 17:25:51,396 INFO L124 PetriNetUnfolderBase]: 7950/18715 cut-off events. [2025-03-08 17:25:51,397 INFO L125 PetriNetUnfolderBase]: For 831603/831711 co-relation queries the response was YES. [2025-03-08 17:25:51,597 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-08 17:25:51,657 INFO L140 encePairwiseOnDemand]: 21/24 looper letters, 1935 selfloop transitions, 336 changer transitions 0/2278 dead transitions. [2025-03-08 17:25:51,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 2278 transitions, 19852 flow [2025-03-08 17:25:51,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 17:25:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-08 17:25:51,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 355 transitions. [2025-03-08 17:25:51,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6431159420289855 [2025-03-08 17:25:51,658 INFO L175 Difference]: Start difference. First operand has 580 places, 896 transitions, 9548 flow. Second operand 23 states and 355 transitions. [2025-03-08 17:25:51,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 2278 transitions, 19852 flow