./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread/triangular-longer-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread/triangular-longer-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 09:43:32,864 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 09:43:32,925 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 09:43:32,929 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 09:43:32,929 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 09:43:32,949 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 09:43:32,950 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 09:43:32,950 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 09:43:32,950 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 09:43:32,951 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 09:43:32,951 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 09:43:32,951 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 09:43:32,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 09:43:32,952 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 09:43:32,952 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 09:43:32,952 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:32,953 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 09:43:32,953 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 09:43:32,953 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 1e30b67a045ce6921ac9aa6cdcebddb50c3d7d787a6b9dd7b66c9173f916fde4 [2025-03-04 09:43:33,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 09:43:33,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 09:43:33,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 09:43:33,216 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 09:43:33,216 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 09:43:33,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/triangular-longer-1.i [2025-03-04 09:43:34,373 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d2fd78/97bc4f0438bc4fb3b14813cc9b19549c/FLAGa97a868a1 [2025-03-04 09:43:34,639 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 09:43:34,640 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/triangular-longer-1.i [2025-03-04 09:43:34,658 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d2fd78/97bc4f0438bc4fb3b14813cc9b19549c/FLAGa97a868a1 [2025-03-04 09:43:34,674 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d78d2fd78/97bc4f0438bc4fb3b14813cc9b19549c [2025-03-04 09:43:34,676 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 09:43:34,677 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 09:43:34,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:34,679 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 09:43:34,682 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 09:43:34,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:34,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160b275d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34, skipping insertion in model container [2025-03-04 09:43:34,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:34,720 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 09:43:34,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:34,930 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 09:43:34,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 09:43:34,984 INFO L204 MainTranslator]: Completed translation [2025-03-04 09:43:34,985 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34 WrapperNode [2025-03-04 09:43:34,985 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 09:43:34,986 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:34,986 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 09:43:34,986 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 09:43:34,990 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:34,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,014 INFO L138 Inliner]: procedures = 168, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 39 [2025-03-04 09:43:35,016 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 09:43:35,017 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 09:43:35,017 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 09:43:35,017 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 09:43:35,023 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,024 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,025 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,034 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 09:43:35,034 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,034 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,037 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,039 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,041 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 09:43:35,041 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 09:43:35,041 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 09:43:35,041 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 09:43:35,042 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (1/1) ... [2025-03-04 09:43:35,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 09:43:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:35,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 09:43:35,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 09:43:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 09:43:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 09:43:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 09:43:35,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 09:43:35,083 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 09:43:35,158 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 09:43:35,160 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 09:43:35,272 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 09:43:35,272 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 09:43:35,323 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 09:43:35,323 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 09:43:35,323 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:35 BoogieIcfgContainer [2025-03-04 09:43:35,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 09:43:35,325 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 09:43:35,325 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 09:43:35,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 09:43:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 09:43:34" (1/3) ... [2025-03-04 09:43:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b44dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:35, skipping insertion in model container [2025-03-04 09:43:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 09:43:34" (2/3) ... [2025-03-04 09:43:35,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@449b44dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 09:43:35, skipping insertion in model container [2025-03-04 09:43:35,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:35" (3/3) ... [2025-03-04 09:43:35,330 INFO L128 eAbstractionObserver]: Analyzing ICFG triangular-longer-1.i [2025-03-04 09:43:35,339 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 09:43:35,340 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG triangular-longer-1.i that has 3 procedures, 26 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-04 09:43:35,341 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 09:43:35,375 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 09:43:35,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:43:35,429 INFO L124 PetriNetUnfolderBase]: 4/27 cut-off events. [2025-03-04 09:43:35,431 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:35,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 27 events. 4/27 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 37 event pairs, 0 based on Foata normal form. 0/21 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 09:43:35,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 32 places, 29 transitions, 66 flow [2025-03-04 09:43:35,437 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 30 places, 27 transitions, 60 flow [2025-03-04 09:43:35,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 09:43:35,453 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=None, 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;@7432aeef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 09:43:35,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-03-04 09:43:35,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 09:43:35,466 INFO L124 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-03-04 09:43:35,466 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:35,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:35,467 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:35,467 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:35,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:35,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979287, now seen corresponding path program 1 times [2025-03-04 09:43:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:35,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002817551] [2025-03-04 09:43:35,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:35,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:35,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:43:35,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:43:35,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:35,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:35,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:35,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:35,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002817551] [2025-03-04 09:43:35,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002817551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:35,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:35,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 09:43:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105675911] [2025-03-04 09:43:35,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:35,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 09:43:35,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:35,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 09:43:35,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 09:43:35,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:35,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 27 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:35,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:35,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:35,840 INFO L124 PetriNetUnfolderBase]: 185/363 cut-off events. [2025-03-04 09:43:35,841 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 09:43:35,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 363 events. 185/363 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1602 event pairs, 135 based on Foata normal form. 32/390 useless extension candidates. Maximal degree in co-relation 657. Up to 290 conditions per place. [2025-03-04 09:43:35,848 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 15 selfloop transitions, 1 changer transitions 1/23 dead transitions. [2025-03-04 09:43:35,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 86 flow [2025-03-04 09:43:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 09:43:35,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 09:43:35,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 44 transitions. [2025-03-04 09:43:35,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2025-03-04 09:43:35,858 INFO L175 Difference]: Start difference. First operand has 30 places, 27 transitions, 60 flow. Second operand 3 states and 44 transitions. [2025-03-04 09:43:35,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 86 flow [2025-03-04 09:43:35,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 23 transitions, 84 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:35,864 INFO L231 Difference]: Finished difference. Result has 28 places, 22 transitions, 50 flow [2025-03-04 09:43:35,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=28, PETRI_TRANSITIONS=22} [2025-03-04 09:43:35,867 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, -2 predicate places. [2025-03-04 09:43:35,867 INFO L471 AbstractCegarLoop]: Abstraction has has 28 places, 22 transitions, 50 flow [2025-03-04 09:43:35,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:35,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:35,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:35,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 09:43:35,868 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:35,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:35,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1499979786, now seen corresponding path program 1 times [2025-03-04 09:43:35,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:35,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126083755] [2025-03-04 09:43:35,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:35,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:35,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 09:43:35,884 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 09:43:35,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:35,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:36,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:36,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:36,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126083755] [2025-03-04 09:43:36,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126083755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:36,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:36,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 09:43:36,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566350401] [2025-03-04 09:43:36,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:36,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 09:43:36,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:36,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 09:43:36,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 09:43:36,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:36,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:36,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:36,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,209 INFO L124 PetriNetUnfolderBase]: 273/491 cut-off events. [2025-03-04 09:43:36,209 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 09:43:36,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 491 events. 273/491 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2024 event pairs, 45 based on Foata normal form. 0/478 useless extension candidates. Maximal degree in co-relation 925. Up to 181 conditions per place. [2025-03-04 09:43:36,211 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 25 selfloop transitions, 4 changer transitions 21/54 dead transitions. [2025-03-04 09:43:36,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 54 transitions, 212 flow [2025-03-04 09:43:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 09:43:36,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 09:43:36,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2025-03-04 09:43:36,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5689655172413793 [2025-03-04 09:43:36,213 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 6 states and 99 transitions. [2025-03-04 09:43:36,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 54 transitions, 212 flow [2025-03-04 09:43:36,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 54 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 09:43:36,215 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 74 flow [2025-03-04 09:43:36,215 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=26, 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=6, PETRI_FLOW=74, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2025-03-04 09:43:36,215 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 5 predicate places. [2025-03-04 09:43:36,215 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 74 flow [2025-03-04 09:43:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,216 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:36,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 09:43:36,216 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:36,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1591607260, now seen corresponding path program 1 times [2025-03-04 09:43:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596682384] [2025-03-04 09:43:36,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:36,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:36,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:36,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:36,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:36,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:36,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596682384] [2025-03-04 09:43:36,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596682384] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:36,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:36,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:36,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323913078] [2025-03-04 09:43:36,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:36,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:36,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:36,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:36,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:36,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:36,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 74 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:36,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:36,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,576 INFO L124 PetriNetUnfolderBase]: 382/707 cut-off events. [2025-03-04 09:43:36,576 INFO L125 PetriNetUnfolderBase]: For 285/291 co-relation queries the response was YES. [2025-03-04 09:43:36,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 707 events. 382/707 cut-off events. For 285/291 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3107 event pairs, 65 based on Foata normal form. 33/739 useless extension candidates. Maximal degree in co-relation 1594. Up to 246 conditions per place. [2025-03-04 09:43:36,582 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 9 changer transitions 20/79 dead transitions. [2025-03-04 09:43:36,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 79 transitions, 382 flow [2025-03-04 09:43:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 09:43:36,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 09:43:36,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 144 transitions. [2025-03-04 09:43:36,584 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5517241379310345 [2025-03-04 09:43:36,585 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 74 flow. Second operand 9 states and 144 transitions. [2025-03-04 09:43:36,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 79 transitions, 382 flow [2025-03-04 09:43:36,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 79 transitions, 366 flow, removed 8 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:36,591 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 159 flow [2025-03-04 09:43:36,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=159, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2025-03-04 09:43:36,592 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 14 predicate places. [2025-03-04 09:43:36,593 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 159 flow [2025-03-04 09:43:36,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,593 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:36,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 09:43:36,593 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:36,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1595175136, now seen corresponding path program 2 times [2025-03-04 09:43:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886502244] [2025-03-04 09:43:36,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 1 equivalence classes. [2025-03-04 09:43:36,607 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 09:43:36,607 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:36,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:36,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:36,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886502244] [2025-03-04 09:43:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886502244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 09:43:36,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568751450] [2025-03-04 09:43:36,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:36,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 09:43:36,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 09:43:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 09:43:36,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:36,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:36,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:36,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:36,884 INFO L124 PetriNetUnfolderBase]: 328/614 cut-off events. [2025-03-04 09:43:36,884 INFO L125 PetriNetUnfolderBase]: For 1001/1013 co-relation queries the response was YES. [2025-03-04 09:43:36,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1744 conditions, 614 events. 328/614 cut-off events. For 1001/1013 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2617 event pairs, 65 based on Foata normal form. 57/670 useless extension candidates. Maximal degree in co-relation 1726. Up to 234 conditions per place. [2025-03-04 09:43:36,887 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 38 selfloop transitions, 9 changer transitions 28/79 dead transitions. [2025-03-04 09:43:36,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 499 flow [2025-03-04 09:43:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 09:43:36,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 09:43:36,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-03-04 09:43:36,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5474137931034483 [2025-03-04 09:43:36,889 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 159 flow. Second operand 8 states and 127 transitions. [2025-03-04 09:43:36,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 499 flow [2025-03-04 09:43:36,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 491 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-04 09:43:36,894 INFO L231 Difference]: Finished difference. Result has 51 places, 34 transitions, 213 flow [2025-03-04 09:43:36,894 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=34} [2025-03-04 09:43:36,895 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 21 predicate places. [2025-03-04 09:43:36,895 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 34 transitions, 213 flow [2025-03-04 09:43:36,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:36,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:36,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:36,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 09:43:36,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:36,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:36,897 INFO L85 PathProgramCache]: Analyzing trace with hash 29952673, now seen corresponding path program 1 times [2025-03-04 09:43:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952499642] [2025-03-04 09:43:36,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:36,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:36,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:36,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:36,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:36,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:37,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952499642] [2025-03-04 09:43:37,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952499642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:37,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510133615] [2025-03-04 09:43:37,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:37,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:37,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:37,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:37,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 34 transitions, 213 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:37,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:37,255 INFO L124 PetriNetUnfolderBase]: 337/626 cut-off events. [2025-03-04 09:43:37,255 INFO L125 PetriNetUnfolderBase]: For 1712/1724 co-relation queries the response was YES. [2025-03-04 09:43:37,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1952 conditions, 626 events. 337/626 cut-off events. For 1712/1724 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2657 event pairs, 68 based on Foata normal form. 30/655 useless extension candidates. Maximal degree in co-relation 1929. Up to 237 conditions per place. [2025-03-04 09:43:37,259 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 46 selfloop transitions, 16 changer transitions 24/90 dead transitions. [2025-03-04 09:43:37,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 90 transitions, 610 flow [2025-03-04 09:43:37,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:43:37,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:43:37,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-04 09:43:37,260 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-03-04 09:43:37,260 INFO L175 Difference]: Start difference. First operand has 51 places, 34 transitions, 213 flow. Second operand 11 states and 168 transitions. [2025-03-04 09:43:37,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 90 transitions, 610 flow [2025-03-04 09:43:37,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 90 transitions, 543 flow, removed 24 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:37,271 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 282 flow [2025-03-04 09:43:37,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=282, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2025-03-04 09:43:37,274 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 26 predicate places. [2025-03-04 09:43:37,274 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 282 flow [2025-03-04 09:43:37,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,274 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:37,274 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:37,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 09:43:37,274 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1774460803, now seen corresponding path program 2 times [2025-03-04 09:43:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770164155] [2025-03-04 09:43:37,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:37,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:37,284 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:37,284 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:37,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:37,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770164155] [2025-03-04 09:43:37,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770164155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:37,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60000821] [2025-03-04 09:43:37,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:37,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:37,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:37,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:37,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:37,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:37,611 INFO L124 PetriNetUnfolderBase]: 508/938 cut-off events. [2025-03-04 09:43:37,611 INFO L125 PetriNetUnfolderBase]: For 3237/3255 co-relation queries the response was YES. [2025-03-04 09:43:37,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3083 conditions, 938 events. 508/938 cut-off events. For 3237/3255 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4321 event pairs, 53 based on Foata normal form. 45/980 useless extension candidates. Maximal degree in co-relation 3059. Up to 253 conditions per place. [2025-03-04 09:43:37,616 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 57 selfloop transitions, 20 changer transitions 23/104 dead transitions. [2025-03-04 09:43:37,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 774 flow [2025-03-04 09:43:37,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:43:37,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:43:37,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2025-03-04 09:43:37,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2025-03-04 09:43:37,617 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 282 flow. Second operand 11 states and 174 transitions. [2025-03-04 09:43:37,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 774 flow [2025-03-04 09:43:37,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 104 transitions, 708 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-03-04 09:43:37,624 INFO L231 Difference]: Finished difference. Result has 67 places, 46 transitions, 379 flow [2025-03-04 09:43:37,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=379, PETRI_PLACES=67, PETRI_TRANSITIONS=46} [2025-03-04 09:43:37,625 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 37 predicate places. [2025-03-04 09:43:37,625 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 46 transitions, 379 flow [2025-03-04 09:43:37,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:37,625 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:37,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 09:43:37,625 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:37,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:37,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1950453345, now seen corresponding path program 3 times [2025-03-04 09:43:37,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:37,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140789797] [2025-03-04 09:43:37,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:37,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:37,632 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-04 09:43:37,635 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 09:43:37,636 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:43:37,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:37,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:37,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:37,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140789797] [2025-03-04 09:43:37,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2140789797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:37,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 09:43:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342687791] [2025-03-04 09:43:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 09:43:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:37,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 09:43:37,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 09:43:37,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:37,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 46 transitions, 379 flow. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:37,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:37,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:37,915 INFO L124 PetriNetUnfolderBase]: 445/836 cut-off events. [2025-03-04 09:43:37,915 INFO L125 PetriNetUnfolderBase]: For 4864/4882 co-relation queries the response was YES. [2025-03-04 09:43:37,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3163 conditions, 836 events. 445/836 cut-off events. For 4864/4882 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3772 event pairs, 71 based on Foata normal form. 63/896 useless extension candidates. Maximal degree in co-relation 3134. Up to 223 conditions per place. [2025-03-04 09:43:37,919 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 44 selfloop transitions, 20 changer transitions 31/99 dead transitions. [2025-03-04 09:43:37,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 99 transitions, 899 flow [2025-03-04 09:43:37,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:43:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:43:37,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-04 09:43:37,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 09:43:37,922 INFO L175 Difference]: Start difference. First operand has 67 places, 46 transitions, 379 flow. Second operand 10 states and 155 transitions. [2025-03-04 09:43:37,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 99 transitions, 899 flow [2025-03-04 09:43:37,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 99 transitions, 830 flow, removed 25 selfloop flow, removed 5 redundant places. [2025-03-04 09:43:37,931 INFO L231 Difference]: Finished difference. Result has 73 places, 47 transitions, 427 flow [2025-03-04 09:43:37,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=427, PETRI_PLACES=73, PETRI_TRANSITIONS=47} [2025-03-04 09:43:37,933 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 43 predicate places. [2025-03-04 09:43:37,934 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 47 transitions, 427 flow [2025-03-04 09:43:37,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:37,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:37,934 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:37,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 09:43:37,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:37,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1345523814, now seen corresponding path program 1 times [2025-03-04 09:43:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:37,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078053396] [2025-03-04 09:43:37,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:37,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:37,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:37,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:37,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:38,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:38,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078053396] [2025-03-04 09:43:38,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078053396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:38,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:38,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:43:38,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476667722] [2025-03-04 09:43:38,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:38,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:38,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:38,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:38,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:38,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:38,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 47 transitions, 427 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:38,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:38,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:38,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:38,257 INFO L124 PetriNetUnfolderBase]: 454/845 cut-off events. [2025-03-04 09:43:38,258 INFO L125 PetriNetUnfolderBase]: For 5578/5596 co-relation queries the response was YES. [2025-03-04 09:43:38,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3316 conditions, 845 events. 454/845 cut-off events. For 5578/5596 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3810 event pairs, 59 based on Foata normal form. 36/878 useless extension candidates. Maximal degree in co-relation 3284. Up to 157 conditions per place. [2025-03-04 09:43:38,261 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 45 selfloop transitions, 26 changer transitions 23/98 dead transitions. [2025-03-04 09:43:38,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 98 transitions, 921 flow [2025-03-04 09:43:38,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 09:43:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 09:43:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 155 transitions. [2025-03-04 09:43:38,262 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5344827586206896 [2025-03-04 09:43:38,262 INFO L175 Difference]: Start difference. First operand has 73 places, 47 transitions, 427 flow. Second operand 10 states and 155 transitions. [2025-03-04 09:43:38,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 98 transitions, 921 flow [2025-03-04 09:43:38,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 98 transitions, 839 flow, removed 25 selfloop flow, removed 8 redundant places. [2025-03-04 09:43:38,275 INFO L231 Difference]: Finished difference. Result has 75 places, 50 transitions, 501 flow [2025-03-04 09:43:38,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=501, PETRI_PLACES=75, PETRI_TRANSITIONS=50} [2025-03-04 09:43:38,275 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 45 predicate places. [2025-03-04 09:43:38,275 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 50 transitions, 501 flow [2025-03-04 09:43:38,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:38,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:38,275 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:38,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 09:43:38,276 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:38,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:38,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1611396395, now seen corresponding path program 1 times [2025-03-04 09:43:38,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:38,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414695112] [2025-03-04 09:43:38,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:38,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:38,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:38,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:38,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:38,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:38,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:38,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414695112] [2025-03-04 09:43:38,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414695112] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:38,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:38,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:43:38,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100025285] [2025-03-04 09:43:38,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:38,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:38,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:38,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:38,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:38,371 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:38,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 50 transitions, 501 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:38,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:38,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:38,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:38,580 INFO L124 PetriNetUnfolderBase]: 490/917 cut-off events. [2025-03-04 09:43:38,580 INFO L125 PetriNetUnfolderBase]: For 7027/7045 co-relation queries the response was YES. [2025-03-04 09:43:38,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3767 conditions, 917 events. 490/917 cut-off events. For 7027/7045 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4218 event pairs, 161 based on Foata normal form. 45/961 useless extension candidates. Maximal degree in co-relation 3734. Up to 540 conditions per place. [2025-03-04 09:43:38,586 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 56 selfloop transitions, 13 changer transitions 31/104 dead transitions. [2025-03-04 09:43:38,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 104 transitions, 1047 flow [2025-03-04 09:43:38,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 09:43:38,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 09:43:38,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2025-03-04 09:43:38,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5266457680250783 [2025-03-04 09:43:38,589 INFO L175 Difference]: Start difference. First operand has 75 places, 50 transitions, 501 flow. Second operand 11 states and 168 transitions. [2025-03-04 09:43:38,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 104 transitions, 1047 flow [2025-03-04 09:43:38,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 104 transitions, 969 flow, removed 22 selfloop flow, removed 7 redundant places. [2025-03-04 09:43:38,609 INFO L231 Difference]: Finished difference. Result has 81 places, 52 transitions, 519 flow [2025-03-04 09:43:38,609 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=519, PETRI_PLACES=81, PETRI_TRANSITIONS=52} [2025-03-04 09:43:38,610 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 51 predicate places. [2025-03-04 09:43:38,610 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 52 transitions, 519 flow [2025-03-04 09:43:38,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:38,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:38,610 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:38,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 09:43:38,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -833258891, now seen corresponding path program 2 times [2025-03-04 09:43:38,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164054158] [2025-03-04 09:43:38,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:38,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:38,617 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:38,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 09:43:38,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:38,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:38,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:38,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164054158] [2025-03-04 09:43:38,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164054158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:38,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:38,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:43:38,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775706314] [2025-03-04 09:43:38,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:38,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:38,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:38,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:38,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:38,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:38,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 52 transitions, 519 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:38,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:38,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:38,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:38,998 INFO L124 PetriNetUnfolderBase]: 643/1211 cut-off events. [2025-03-04 09:43:38,999 INFO L125 PetriNetUnfolderBase]: For 12283/12301 co-relation queries the response was YES. [2025-03-04 09:43:39,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5363 conditions, 1211 events. 643/1211 cut-off events. For 12283/12301 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5898 event pairs, 134 based on Foata normal form. 45/1255 useless extension candidates. Maximal degree in co-relation 5327. Up to 465 conditions per place. [2025-03-04 09:43:39,006 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 76 selfloop transitions, 23 changer transitions 31/134 dead transitions. [2025-03-04 09:43:39,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 134 transitions, 1387 flow [2025-03-04 09:43:39,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 09:43:39,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-04 09:43:39,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 232 transitions. [2025-03-04 09:43:39,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-03-04 09:43:39,008 INFO L175 Difference]: Start difference. First operand has 81 places, 52 transitions, 519 flow. Second operand 15 states and 232 transitions. [2025-03-04 09:43:39,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 134 transitions, 1387 flow [2025-03-04 09:43:39,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 134 transitions, 1219 flow, removed 73 selfloop flow, removed 8 redundant places. [2025-03-04 09:43:39,024 INFO L231 Difference]: Finished difference. Result has 91 places, 58 transitions, 635 flow [2025-03-04 09:43:39,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=635, PETRI_PLACES=91, PETRI_TRANSITIONS=58} [2025-03-04 09:43:39,025 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 61 predicate places. [2025-03-04 09:43:39,026 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 58 transitions, 635 flow [2025-03-04 09:43:39,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:39,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 09:43:39,027 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -836826767, now seen corresponding path program 3 times [2025-03-04 09:43:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254222229] [2025-03-04 09:43:39,027 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:39,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 19 statements into 1 equivalence classes. [2025-03-04 09:43:39,037 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 09:43:39,038 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 09:43:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:39,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:39,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:39,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254222229] [2025-03-04 09:43:39,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254222229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:43:39,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 09:43:39,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 09:43:39,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863950] [2025-03-04 09:43:39,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:43:39,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 09:43:39,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:39,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 09:43:39,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 09:43:39,130 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:39,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 58 transitions, 635 flow. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:39,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:39,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:39,388 INFO L124 PetriNetUnfolderBase]: 580/1094 cut-off events. [2025-03-04 09:43:39,388 INFO L125 PetriNetUnfolderBase]: For 12793/12811 co-relation queries the response was YES. [2025-03-04 09:43:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5016 conditions, 1094 events. 580/1094 cut-off events. For 12793/12811 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5248 event pairs, 140 based on Foata normal form. 63/1156 useless extension candidates. Maximal degree in co-relation 4976. Up to 435 conditions per place. [2025-03-04 09:43:39,395 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 64 selfloop transitions, 24 changer transitions 39/131 dead transitions. [2025-03-04 09:43:39,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 131 transitions, 1443 flow [2025-03-04 09:43:39,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 09:43:39,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 09:43:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 215 transitions. [2025-03-04 09:43:39,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5295566502463054 [2025-03-04 09:43:39,396 INFO L175 Difference]: Start difference. First operand has 91 places, 58 transitions, 635 flow. Second operand 14 states and 215 transitions. [2025-03-04 09:43:39,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 131 transitions, 1443 flow [2025-03-04 09:43:39,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 131 transitions, 1275 flow, removed 68 selfloop flow, removed 10 redundant places. [2025-03-04 09:43:39,412 INFO L231 Difference]: Finished difference. Result has 96 places, 59 transitions, 638 flow [2025-03-04 09:43:39,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=638, PETRI_PLACES=96, PETRI_TRANSITIONS=59} [2025-03-04 09:43:39,413 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 66 predicate places. [2025-03-04 09:43:39,413 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 59 transitions, 638 flow [2025-03-04 09:43:39,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:39,413 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:39,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 09:43:39,414 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:39,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:39,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1779029952, now seen corresponding path program 1 times [2025-03-04 09:43:39,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:39,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414788670] [2025-03-04 09:43:39,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:39,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:39,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:39,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:39,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:39,524 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:39,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414788670] [2025-03-04 09:43:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414788670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:39,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76626658] [2025-03-04 09:43:39,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 09:43:39,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:39,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:39,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:39,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 09:43:39,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 09:43:39,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:39,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:39,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:39,579 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:43:39,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:39,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:39,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:39,810 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:39,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76626658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:39,810 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:39,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 09:43:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899309900] [2025-03-04 09:43:39,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:39,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:39,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:39,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:39,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:39,812 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 59 transitions, 638 flow. Second operand has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:39,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:39,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:39,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:40,335 INFO L124 PetriNetUnfolderBase]: 877/1649 cut-off events. [2025-03-04 09:43:40,335 INFO L125 PetriNetUnfolderBase]: For 24500/24518 co-relation queries the response was YES. [2025-03-04 09:43:40,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8250 conditions, 1649 events. 877/1649 cut-off events. For 24500/24518 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 8074 event pairs, 65 based on Foata normal form. 81/1727 useless extension candidates. Maximal degree in co-relation 8208. Up to 312 conditions per place. [2025-03-04 09:43:40,345 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 91 selfloop transitions, 46 changer transitions 67/208 dead transitions. [2025-03-04 09:43:40,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 208 transitions, 2376 flow [2025-03-04 09:43:40,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-04 09:43:40,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-03-04 09:43:40,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 384 transitions. [2025-03-04 09:43:40,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5296551724137931 [2025-03-04 09:43:40,349 INFO L175 Difference]: Start difference. First operand has 96 places, 59 transitions, 638 flow. Second operand 25 states and 384 transitions. [2025-03-04 09:43:40,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 208 transitions, 2376 flow [2025-03-04 09:43:40,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 208 transitions, 2192 flow, removed 72 selfloop flow, removed 12 redundant places. [2025-03-04 09:43:40,378 INFO L231 Difference]: Finished difference. Result has 120 places, 69 transitions, 965 flow [2025-03-04 09:43:40,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=965, PETRI_PLACES=120, PETRI_TRANSITIONS=69} [2025-03-04 09:43:40,380 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 90 predicate places. [2025-03-04 09:43:40,380 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 69 transitions, 965 flow [2025-03-04 09:43:40,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.066666666666666) internal successors, (151), 15 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:40,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:40,381 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:40,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:40,581 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,SelfDestructingSolverStorable11 [2025-03-04 09:43:40,582 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:40,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:40,583 INFO L85 PathProgramCache]: Analyzing trace with hash -230915460, now seen corresponding path program 2 times [2025-03-04 09:43:40,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:40,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689255215] [2025-03-04 09:43:40,583 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:40,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:40,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 09:43:40,592 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:40,592 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:40,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:40,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689255215] [2025-03-04 09:43:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689255215] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:40,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661985245] [2025-03-04 09:43:40,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:40,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:40,686 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:40,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 09:43:40,719 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 09:43:40,731 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 09:43:40,731 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:40,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:40,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 09:43:40,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:40,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:40,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661985245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:40,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:40,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 09:43:40,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846509008] [2025-03-04 09:43:40,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:40,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 09:43:40,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:40,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 09:43:40,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-03-04 09:43:40,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:40,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 69 transitions, 965 flow. Second operand has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:40,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:40,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:40,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:41,572 INFO L124 PetriNetUnfolderBase]: 1021/1931 cut-off events. [2025-03-04 09:43:41,572 INFO L125 PetriNetUnfolderBase]: For 63293/63311 co-relation queries the response was YES. [2025-03-04 09:43:41,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12119 conditions, 1931 events. 1021/1931 cut-off events. For 63293/63311 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 9587 event pairs, 38 based on Foata normal form. 126/2056 useless extension candidates. Maximal degree in co-relation 12065. Up to 390 conditions per place. [2025-03-04 09:43:41,587 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 91 selfloop transitions, 63 changer transitions 98/256 dead transitions. [2025-03-04 09:43:41,587 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 256 transitions, 3882 flow [2025-03-04 09:43:41,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 09:43:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 09:43:41,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 459 transitions. [2025-03-04 09:43:41,589 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5275862068965518 [2025-03-04 09:43:41,589 INFO L175 Difference]: Start difference. First operand has 120 places, 69 transitions, 965 flow. Second operand 30 states and 459 transitions. [2025-03-04 09:43:41,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 256 transitions, 3882 flow [2025-03-04 09:43:41,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 256 transitions, 3122 flow, removed 346 selfloop flow, removed 19 redundant places. [2025-03-04 09:43:41,634 INFO L231 Difference]: Finished difference. Result has 142 places, 87 transitions, 1383 flow [2025-03-04 09:43:41,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1383, PETRI_PLACES=142, PETRI_TRANSITIONS=87} [2025-03-04 09:43:41,635 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 112 predicate places. [2025-03-04 09:43:41,636 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 87 transitions, 1383 flow [2025-03-04 09:43:41,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.133333333333333) internal successors, (152), 15 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:41,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:41,636 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:41,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 09:43:41,840 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,SelfDestructingSolverStorable12 [2025-03-04 09:43:41,840 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:41,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash 2049794340, now seen corresponding path program 3 times [2025-03-04 09:43:41,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:41,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917876455] [2025-03-04 09:43:41,841 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:41,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:41,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-04 09:43:41,851 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:41,851 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 09:43:41,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:41,979 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:41,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917876455] [2025-03-04 09:43:41,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917876455] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:41,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259507556] [2025-03-04 09:43:41,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:43:41,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:41,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:41,982 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:41,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 09:43:42,015 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 34 statements into 4 equivalence classes. [2025-03-04 09:43:42,028 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 09:43:42,028 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-04 09:43:42,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:42,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 09:43:42,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:42,099 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,100 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:42,257 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:42,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259507556] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:42,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:42,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 24 [2025-03-04 09:43:42,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773260336] [2025-03-04 09:43:42,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:42,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 09:43:42,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:42,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 09:43:42,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2025-03-04 09:43:42,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:42,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 87 transitions, 1383 flow. Second operand has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:42,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:42,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:42,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:43,551 INFO L124 PetriNetUnfolderBase]: 1669/3072 cut-off events. [2025-03-04 09:43:43,551 INFO L125 PetriNetUnfolderBase]: For 142770/142776 co-relation queries the response was YES. [2025-03-04 09:43:43,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22092 conditions, 3072 events. 1669/3072 cut-off events. For 142770/142776 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 15162 event pairs, 42 based on Foata normal form. 96/3167 useless extension candidates. Maximal degree in co-relation 22029. Up to 648 conditions per place. [2025-03-04 09:43:43,575 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 141 selfloop transitions, 109 changer transitions 135/389 dead transitions. [2025-03-04 09:43:43,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 389 transitions, 6740 flow [2025-03-04 09:43:43,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 09:43:43,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 09:43:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 703 transitions. [2025-03-04 09:43:43,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5269865067466267 [2025-03-04 09:43:43,577 INFO L175 Difference]: Start difference. First operand has 142 places, 87 transitions, 1383 flow. Second operand 46 states and 703 transitions. [2025-03-04 09:43:43,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 389 transitions, 6740 flow [2025-03-04 09:43:43,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 389 transitions, 5582 flow, removed 542 selfloop flow, removed 21 redundant places. [2025-03-04 09:43:43,667 INFO L231 Difference]: Finished difference. Result has 186 places, 133 transitions, 2467 flow [2025-03-04 09:43:43,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1011, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=2467, PETRI_PLACES=186, PETRI_TRANSITIONS=133} [2025-03-04 09:43:43,667 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 156 predicate places. [2025-03-04 09:43:43,668 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 133 transitions, 2467 flow [2025-03-04 09:43:43,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 10.0) internal successors, (250), 25 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:43,668 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:43,668 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:43,674 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-04 09:43:43,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:43,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:43,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:43,873 INFO L85 PathProgramCache]: Analyzing trace with hash -573102411, now seen corresponding path program 4 times [2025-03-04 09:43:43,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:43,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119157060] [2025-03-04 09:43:43,873 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:43:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:43,877 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-04 09:43:43,881 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:43,882 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:43:43,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119157060] [2025-03-04 09:43:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119157060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:44,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277352320] [2025-03-04 09:43:44,173 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 09:43:44,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:44,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:44,175 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:44,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 09:43:44,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-04 09:43:44,224 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:44,225 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 09:43:44,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:44,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:44,227 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:44,342 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:44,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277352320] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:44,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:44,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 26 [2025-03-04 09:43:44,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51207607] [2025-03-04 09:43:44,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:44,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 09:43:44,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:44,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 09:43:44,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=551, Unknown=0, NotChecked=0, Total=702 [2025-03-04 09:43:44,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:44,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 133 transitions, 2467 flow. Second operand has 27 states, 27 states have (on average 10.185185185185185) internal successors, (275), 27 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:44,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:44,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:44,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:45,613 INFO L124 PetriNetUnfolderBase]: 1939/3738 cut-off events. [2025-03-04 09:43:45,613 INFO L125 PetriNetUnfolderBase]: For 311524/311530 co-relation queries the response was YES. [2025-03-04 09:43:45,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31369 conditions, 3738 events. 1939/3738 cut-off events. For 311524/311530 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 19825 event pairs, 403 based on Foata normal form. 87/3822 useless extension candidates. Maximal degree in co-relation 31290. Up to 1447 conditions per place. [2025-03-04 09:43:45,639 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 160 selfloop transitions, 88 changer transitions 115/367 dead transitions. [2025-03-04 09:43:45,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 367 transitions, 8205 flow [2025-03-04 09:43:45,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-04 09:43:45,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2025-03-04 09:43:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 564 transitions. [2025-03-04 09:43:45,642 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5117967332123412 [2025-03-04 09:43:45,642 INFO L175 Difference]: Start difference. First operand has 186 places, 133 transitions, 2467 flow. Second operand 38 states and 564 transitions. [2025-03-04 09:43:45,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 367 transitions, 8205 flow [2025-03-04 09:43:45,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 367 transitions, 6436 flow, removed 861 selfloop flow, removed 21 redundant places. [2025-03-04 09:43:45,931 INFO L231 Difference]: Finished difference. Result has 211 places, 165 transitions, 2892 flow [2025-03-04 09:43:45,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=1782, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2892, PETRI_PLACES=211, PETRI_TRANSITIONS=165} [2025-03-04 09:43:45,932 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 181 predicate places. [2025-03-04 09:43:45,932 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 165 transitions, 2892 flow [2025-03-04 09:43:45,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.185185185185185) internal successors, (275), 27 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:45,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:45,932 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:45,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 09:43:46,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 09:43:46,133 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:46,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:46,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1216995193, now seen corresponding path program 5 times [2025-03-04 09:43:46,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:46,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614133549] [2025-03-04 09:43:46,134 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:43:46,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:46,138 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 4 equivalence classes. [2025-03-04 09:43:46,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:46,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 09:43:46,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614133549] [2025-03-04 09:43:46,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614133549] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:46,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099930367] [2025-03-04 09:43:46,505 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 09:43:46,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:46,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:46,507 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:46,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 09:43:46,537 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 52 statements into 4 equivalence classes. [2025-03-04 09:43:46,549 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:46,550 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-04 09:43:46,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:46,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:46,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:46,670 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:46,917 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:46,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099930367] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:46,917 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2025-03-04 09:43:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981674026] [2025-03-04 09:43:46,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 09:43:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:46,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 09:43:46,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2025-03-04 09:43:46,920 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:46,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 165 transitions, 2892 flow. Second operand has 31 states, 31 states have (on average 10.225806451612904) internal successors, (317), 31 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:46,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:46,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:46,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:48,347 INFO L124 PetriNetUnfolderBase]: 2434/4865 cut-off events. [2025-03-04 09:43:48,347 INFO L125 PetriNetUnfolderBase]: For 466650/466656 co-relation queries the response was YES. [2025-03-04 09:43:48,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40939 conditions, 4865 events. 2434/4865 cut-off events. For 466650/466656 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 28085 event pairs, 194 based on Foata normal form. 87/4951 useless extension candidates. Maximal degree in co-relation 40853. Up to 1152 conditions per place. [2025-03-04 09:43:48,382 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 153 selfloop transitions, 171 changer transitions 127/455 dead transitions. [2025-03-04 09:43:48,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 455 transitions, 9699 flow [2025-03-04 09:43:48,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-03-04 09:43:48,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2025-03-04 09:43:48,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 659 transitions. [2025-03-04 09:43:48,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5164576802507836 [2025-03-04 09:43:48,384 INFO L175 Difference]: Start difference. First operand has 211 places, 165 transitions, 2892 flow. Second operand 44 states and 659 transitions. [2025-03-04 09:43:48,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 455 transitions, 9699 flow [2025-03-04 09:43:48,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 455 transitions, 8582 flow, removed 529 selfloop flow, removed 20 redundant places. [2025-03-04 09:43:48,923 INFO L231 Difference]: Finished difference. Result has 244 places, 219 transitions, 4223 flow [2025-03-04 09:43:48,924 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=2411, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=125, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=4223, PETRI_PLACES=244, PETRI_TRANSITIONS=219} [2025-03-04 09:43:48,924 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 214 predicate places. [2025-03-04 09:43:48,924 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 219 transitions, 4223 flow [2025-03-04 09:43:48,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.225806451612904) internal successors, (317), 31 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:48,924 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:48,924 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:48,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 09:43:49,125 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,SelfDestructingSolverStorable15 [2025-03-04 09:43:49,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:49,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:49,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1082171783, now seen corresponding path program 6 times [2025-03-04 09:43:49,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:49,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983633644] [2025-03-04 09:43:49,126 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:43:49,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:49,130 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 8 equivalence classes. [2025-03-04 09:43:49,140 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:49,140 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 09:43:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:49,320 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:49,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983633644] [2025-03-04 09:43:49,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983633644] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:49,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1319885076] [2025-03-04 09:43:49,320 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 09:43:49,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:49,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:49,322 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:49,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 09:43:49,352 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 52 statements into 8 equivalence classes. [2025-03-04 09:43:49,369 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 09:43:49,369 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-04 09:43:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:49,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-04 09:43:49,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:49,443 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:49,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:49,657 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:49,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1319885076] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:49,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:49,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 30 [2025-03-04 09:43:49,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352957118] [2025-03-04 09:43:49,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:49,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-04 09:43:49,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:49,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-04 09:43:49,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=769, Unknown=0, NotChecked=0, Total=930 [2025-03-04 09:43:49,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:49,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 219 transitions, 4223 flow. Second operand has 31 states, 31 states have (on average 10.096774193548388) internal successors, (313), 31 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:49,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:49,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:49,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:51,327 INFO L124 PetriNetUnfolderBase]: 3073/6076 cut-off events. [2025-03-04 09:43:51,328 INFO L125 PetriNetUnfolderBase]: For 773470/773476 co-relation queries the response was YES. [2025-03-04 09:43:51,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57860 conditions, 6076 events. 3073/6076 cut-off events. For 773470/773476 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 35460 event pairs, 47 based on Foata normal form. 87/6160 useless extension candidates. Maximal degree in co-relation 57763. Up to 1446 conditions per place. [2025-03-04 09:43:51,388 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 182 selfloop transitions, 225 changer transitions 121/532 dead transitions. [2025-03-04 09:43:51,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 532 transitions, 12737 flow [2025-03-04 09:43:51,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-04 09:43:51,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2025-03-04 09:43:51,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 749 transitions. [2025-03-04 09:43:51,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5270935960591133 [2025-03-04 09:43:51,390 INFO L175 Difference]: Start difference. First operand has 244 places, 219 transitions, 4223 flow. Second operand 49 states and 749 transitions. [2025-03-04 09:43:51,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 532 transitions, 12737 flow [2025-03-04 09:43:51,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 532 transitions, 11018 flow, removed 808 selfloop flow, removed 24 redundant places. [2025-03-04 09:43:51,998 INFO L231 Difference]: Finished difference. Result has 281 places, 255 transitions, 5407 flow [2025-03-04 09:43:51,999 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=3488, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=191, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=49, PETRI_FLOW=5407, PETRI_PLACES=281, PETRI_TRANSITIONS=255} [2025-03-04 09:43:51,999 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 251 predicate places. [2025-03-04 09:43:51,999 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 255 transitions, 5407 flow [2025-03-04 09:43:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 10.096774193548388) internal successors, (313), 31 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:52,000 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:52,000 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:52,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 09:43:52,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 09:43:52,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:52,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:52,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1331816570, now seen corresponding path program 7 times [2025-03-04 09:43:52,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:52,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399356607] [2025-03-04 09:43:52,203 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 09:43:52,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:52,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:43:52,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:43:52,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:52,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:52,475 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:52,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399356607] [2025-03-04 09:43:52,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399356607] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:52,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10597173] [2025-03-04 09:43:52,475 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-04 09:43:52,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:52,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:52,478 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:52,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 09:43:52,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 09:43:52,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 09:43:52,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 09:43:52,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:52,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-03-04 09:43:52,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:52,610 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:52,610 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:52,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10597173] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:52,871 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:52,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 27 [2025-03-04 09:43:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967580273] [2025-03-04 09:43:52,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:52,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 09:43:52,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:52,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 09:43:52,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=600, Unknown=0, NotChecked=0, Total=756 [2025-03-04 09:43:52,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:52,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 255 transitions, 5407 flow. Second operand has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:52,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:52,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:52,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:54,651 INFO L124 PetriNetUnfolderBase]: 3082/6117 cut-off events. [2025-03-04 09:43:54,651 INFO L125 PetriNetUnfolderBase]: For 981467/981473 co-relation queries the response was YES. [2025-03-04 09:43:54,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62070 conditions, 6117 events. 3082/6117 cut-off events. For 981467/981473 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 35766 event pairs, 38 based on Foata normal form. 123/6239 useless extension candidates. Maximal degree in co-relation 61959. Up to 1452 conditions per place. [2025-03-04 09:43:54,698 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 174 selfloop transitions, 242 changer transitions 139/559 dead transitions. [2025-03-04 09:43:54,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 559 transitions, 14137 flow [2025-03-04 09:43:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 09:43:54,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-04 09:43:54,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 789 transitions. [2025-03-04 09:43:54,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.523209549071618 [2025-03-04 09:43:54,700 INFO L175 Difference]: Start difference. First operand has 281 places, 255 transitions, 5407 flow. Second operand 52 states and 789 transitions. [2025-03-04 09:43:54,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 559 transitions, 14137 flow [2025-03-04 09:43:55,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 295 places, 559 transitions, 12231 flow, removed 863 selfloop flow, removed 28 redundant places. [2025-03-04 09:43:55,752 INFO L231 Difference]: Finished difference. Result has 312 places, 268 transitions, 5884 flow [2025-03-04 09:43:55,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4407, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=255, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=230, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=5884, PETRI_PLACES=312, PETRI_TRANSITIONS=268} [2025-03-04 09:43:55,752 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 282 predicate places. [2025-03-04 09:43:55,753 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 268 transitions, 5884 flow [2025-03-04 09:43:55,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 10.142857142857142) internal successors, (284), 28 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:55,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:43:55,753 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:43:55,758 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-04 09:43:55,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:55,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:43:55,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:43:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 2027338130, now seen corresponding path program 8 times [2025-03-04 09:43:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:43:55,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995137199] [2025-03-04 09:43:55,955 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:55,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:43:55,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 09:43:55,963 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 09:43:55,964 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:55,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:56,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:43:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995137199] [2025-03-04 09:43:56,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995137199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:43:56,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696993624] [2025-03-04 09:43:56,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 09:43:56,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:43:56,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:43:56,263 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:43:56,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 09:43:56,295 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 70 statements into 2 equivalence classes. [2025-03-04 09:43:56,308 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 09:43:56,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 09:43:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:43:56,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 09:43:56,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:43:56,400 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:56,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 09:43:56,713 INFO L134 CoverageAnalysis]: Checked inductivity of 249 backedges. 0 proven. 249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 09:43:56,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696993624] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 09:43:56,714 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 09:43:56,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 48 [2025-03-04 09:43:56,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830791234] [2025-03-04 09:43:56,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 09:43:56,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-03-04 09:43:56,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:43:56,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-03-04 09:43:56,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=1860, Unknown=0, NotChecked=0, Total=2352 [2025-03-04 09:43:56,716 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:43:56,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 268 transitions, 5884 flow. Second operand has 49 states, 49 states have (on average 10.0) internal successors, (490), 49 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:43:56,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:43:56,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:43:56,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:43:59,101 INFO L124 PetriNetUnfolderBase]: 3379/6670 cut-off events. [2025-03-04 09:43:59,102 INFO L125 PetriNetUnfolderBase]: For 1153141/1153147 co-relation queries the response was YES. [2025-03-04 09:43:59,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69185 conditions, 6670 events. 3379/6670 cut-off events. For 1153141/1153147 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 39281 event pairs, 102 based on Foata normal form. 42/6711 useless extension candidates. Maximal degree in co-relation 69067. Up to 1584 conditions per place. [2025-03-04 09:43:59,162 INFO L140 encePairwiseOnDemand]: 23/29 looper letters, 197 selfloop transitions, 265 changer transitions 117/583 dead transitions. [2025-03-04 09:43:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 583 transitions, 14679 flow [2025-03-04 09:43:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-03-04 09:43:59,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2025-03-04 09:43:59,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 787 transitions. [2025-03-04 09:43:59,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5218832891246684 [2025-03-04 09:43:59,164 INFO L175 Difference]: Start difference. First operand has 312 places, 268 transitions, 5884 flow. Second operand 52 states and 787 transitions. [2025-03-04 09:43:59,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 583 transitions, 14679 flow [2025-03-04 09:44:00,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 583 transitions, 12640 flow, removed 822 selfloop flow, removed 42 redundant places. [2025-03-04 09:44:00,869 INFO L231 Difference]: Finished difference. Result has 326 places, 301 transitions, 6457 flow [2025-03-04 09:44:00,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4711, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=233, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=52, PETRI_FLOW=6457, PETRI_PLACES=326, PETRI_TRANSITIONS=301} [2025-03-04 09:44:00,869 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 296 predicate places. [2025-03-04 09:44:00,870 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 301 transitions, 6457 flow [2025-03-04 09:44:00,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 10.0) internal successors, (490), 49 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:00,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 09:44:00,870 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 09:44:00,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 09:44:01,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:01,070 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-03-04 09:44:01,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 09:44:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 355976563, now seen corresponding path program 9 times [2025-03-04 09:44:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 09:44:01,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82370378] [2025-03-04 09:44:01,072 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 09:44:01,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 11 equivalence classes. [2025-03-04 09:44:01,095 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 70 of 73 statements. [2025-03-04 09:44:01,095 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 09:44:01,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:01,206 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 209 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 09:44:01,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 09:44:01,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82370378] [2025-03-04 09:44:01,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82370378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 09:44:01,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54721375] [2025-03-04 09:44:01,206 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 09:44:01,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:01,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 09:44:01,208 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 09:44:01,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 09:44:01,242 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 11 equivalence classes. [2025-03-04 09:44:01,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) and asserted 70 of 73 statements. [2025-03-04 09:44:01,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2025-03-04 09:44:01,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 09:44:01,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-04 09:44:01,267 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 09:44:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 09:44:01,327 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 09:44:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54721375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 09:44:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 09:44:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 14 [2025-03-04 09:44:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326713140] [2025-03-04 09:44:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 09:44:01,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 09:44:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 09:44:01,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 09:44:01,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2025-03-04 09:44:01,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 29 [2025-03-04 09:44:01,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 301 transitions, 6457 flow. Second operand has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:01,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 09:44:01,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 29 [2025-03-04 09:44:01,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 09:44:07,154 INFO L124 PetriNetUnfolderBase]: 18901/32155 cut-off events. [2025-03-04 09:44:07,154 INFO L125 PetriNetUnfolderBase]: For 4767395/4767400 co-relation queries the response was YES. [2025-03-04 09:44:07,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 289498 conditions, 32155 events. 18901/32155 cut-off events. For 4767395/4767400 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 231223 event pairs, 258 based on Foata normal form. 1/28821 useless extension candidates. Maximal degree in co-relation 289380. Up to 6779 conditions per place. [2025-03-04 09:44:07,699 INFO L140 encePairwiseOnDemand]: 25/29 looper letters, 0 selfloop transitions, 0 changer transitions 1756/1756 dead transitions. [2025-03-04 09:44:07,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 1756 transitions, 37258 flow [2025-03-04 09:44:07,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 09:44:07,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 09:44:07,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 245 transitions. [2025-03-04 09:44:07,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.649867374005305 [2025-03-04 09:44:07,701 INFO L175 Difference]: Start difference. First operand has 326 places, 301 transitions, 6457 flow. Second operand 13 states and 245 transitions. [2025-03-04 09:44:07,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 1756 transitions, 37258 flow [2025-03-04 09:44:16,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 1756 transitions, 33124 flow, removed 605 selfloop flow, removed 47 redundant places. [2025-03-04 09:44:16,508 INFO L231 Difference]: Finished difference. Result has 283 places, 0 transitions, 0 flow [2025-03-04 09:44:16,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=29, PETRI_DIFFERENCE_MINUEND_FLOW=4943, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=283, PETRI_TRANSITIONS=0} [2025-03-04 09:44:16,509 INFO L279 CegarLoopForPetriNet]: 30 programPoint places, 253 predicate places. [2025-03-04 09:44:16,509 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 0 transitions, 0 flow [2025-03-04 09:44:16,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 12.692307692307692) internal successors, (165), 13 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 09:44:16,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (3 of 4 remaining) [2025-03-04 09:44:16,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (2 of 4 remaining) [2025-03-04 09:44:16,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-03-04 09:44:16,512 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-03-04 09:44:16,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 09:44:16,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 09:44:16,713 INFO L422 BasicCegarLoop]: Path program histogram: [9, 3, 3, 2, 1, 1, 1] [2025-03-04 09:44:16,715 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 09:44:16,715 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 09:44:16,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 09:44:16 BasicIcfg [2025-03-04 09:44:16,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 09:44:16,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 09:44:16,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 09:44:16,720 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 09:44:16,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 09:43:35" (3/4) ... [2025-03-04 09:44:16,722 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 09:44:16,724 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t1 [2025-03-04 09:44:16,724 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t2 [2025-03-04 09:44:16,726 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2025-03-04 09:44:16,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 09:44:16,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 09:44:16,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 09:44:16,727 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 09:44:16,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 09:44:16,783 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 09:44:16,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 09:44:16,784 INFO L158 Benchmark]: Toolchain (without parser) took 42106.99ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 110.4MB in the beginning and 496.1MB in the end (delta: -385.7MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-03-04 09:44:16,784 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:16,785 INFO L158 Benchmark]: CACSL2BoogieTranslator took 306.80ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:44:16,785 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.79ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:16,785 INFO L158 Benchmark]: Boogie Preprocessor took 23.64ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 09:44:16,786 INFO L158 Benchmark]: IcfgBuilder took 282.38ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 70.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 09:44:16,787 INFO L158 Benchmark]: TraceAbstraction took 41393.56ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 69.6MB in the beginning and 498.6MB in the end (delta: -429.0MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-03-04 09:44:16,787 INFO L158 Benchmark]: Witness Printer took 63.91ms. Allocated memory is still 1.6GB. Free memory was 498.6MB in the beginning and 496.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 09:44:16,788 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 306.80ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 91.1MB in the end (delta: 19.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.79ms. Allocated memory is still 142.6MB. Free memory was 91.1MB in the beginning and 89.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.64ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 88.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 282.38ms. Allocated memory is still 142.6MB. Free memory was 88.5MB in the beginning and 70.1MB in the end (delta: 18.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 41393.56ms. Allocated memory was 142.6MB in the beginning and 1.6GB in the end (delta: 1.4GB). Free memory was 69.6MB in the beginning and 498.6MB in the end (delta: -429.0MB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 63.91ms. Allocated memory is still 1.6GB. Free memory was 498.6MB in the beginning and 496.1MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 711]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 693]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 38 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 41.3s, OverallIterations: 20, TraceHistogramMax: 11, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 33.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5818 SdHoareTripleChecker+Valid, 3.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5812 mSDsluCounter, 23 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 18 mSDsCounter, 376 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6951 IncrementalHoareTripleChecker+Invalid, 7327 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 376 mSolverCounterUnsat, 5 mSDtfsCounter, 6951 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1333 GetRequests, 696 SyntacticMatches, 16 SemanticMatches, 621 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10052 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6457occurred in iteration=19, InterpolantAutomatonStates: 457, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 1040 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 79 NumberOfCheckSat, 1365 ConstructedInterpolants, 0 QuantifiedInterpolants, 5395 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1254 ConjunctsInSsa, 154 ConjunctsInUnsatCore, 37 InterpolantComputations, 12 PerfectInterpolantSequences, 450/2405 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 09:44:16,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE