./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.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/goblint-regression/13-privatized_25-struct_nr_true.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 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:02:08,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:02:08,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 10:02:08,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:02:08,214 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:02:08,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:02:08,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:02:08,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:02:08,233 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:02:08,233 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:02:08,234 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:02:08,234 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:02:08,234 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:02:08,234 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:02:08,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:02:08,235 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:02:08,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:02:08,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:02:08,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:02:08,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:02:08,236 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 -> 4017723c7e4b1f7c431c7e7a6ea6ca9df8ac56fc590cd03021a11577cb455eff [2025-03-04 10:02:08,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:02:08,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:02:08,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:02:08,462 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:02:08,462 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:02:08,463 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-04 10:02:09,602 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f7bcca1/ebace58d03814d98b71fa72cb858b88c/FLAGc78fe2121 [2025-03-04 10:02:09,868 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:02:09,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_25-struct_nr_true.i [2025-03-04 10:02:09,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f7bcca1/ebace58d03814d98b71fa72cb858b88c/FLAGc78fe2121 [2025-03-04 10:02:10,170 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57f7bcca1/ebace58d03814d98b71fa72cb858b88c [2025-03-04 10:02:10,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:02:10,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:02:10,176 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:02:10,176 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:02:10,179 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:02:10,180 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,181 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb98ed7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10, skipping insertion in model container [2025-03-04 10:02:10,182 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,206 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:02:10,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:02:10,462 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:02:10,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:02:10,524 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:02:10,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10 WrapperNode [2025-03-04 10:02:10,524 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:02:10,525 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:02:10,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:02:10,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:02:10,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,551 INFO L138 Inliner]: procedures = 162, calls = 22, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 83 [2025-03-04 10:02:10,551 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:02:10,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:02:10,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:02:10,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:02:10,557 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,566 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-04 10:02:10,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,570 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,571 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,572 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,573 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:02:10,573 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:02:10,573 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:02:10,574 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:02:10,574 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (1/1) ... [2025-03-04 10:02:10,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:02:10,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:02:10,596 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 10:02:10,598 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 10:02:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 10:02:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:02:10,615 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 10:02:10,615 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 10:02:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:02:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:02:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 10:02:10,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:02:10,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:02:10,617 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 10:02:10,698 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:02:10,699 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:02:10,815 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 10:02:10,815 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:02:10,895 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:02:10,895 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:02:10,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:02:10 BoogieIcfgContainer [2025-03-04 10:02:10,895 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:02:10,898 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:02:10,898 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:02:10,901 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:02:10,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:02:10" (1/3) ... [2025-03-04 10:02:10,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3f758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:02:10, skipping insertion in model container [2025-03-04 10:02:10,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:02:10" (2/3) ... [2025-03-04 10:02:10,903 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62e3f758 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:02:10, skipping insertion in model container [2025-03-04 10:02:10,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:02:10" (3/3) ... [2025-03-04 10:02:10,904 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_25-struct_nr_true.i [2025-03-04 10:02:10,915 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:02:10,917 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_25-struct_nr_true.i that has 2 procedures, 42 locations, 1 initial locations, 0 loop locations, and 5 error locations. [2025-03-04 10:02:10,917 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 10:02:10,951 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 10:02:10,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 45 places, 49 transitions, 105 flow [2025-03-04 10:02:11,003 INFO L124 PetriNetUnfolderBase]: 8/48 cut-off events. [2025-03-04 10:02:11,005 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:02:11,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53 conditions, 48 events. 8/48 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 99 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 34. Up to 2 conditions per place. [2025-03-04 10:02:11,007 INFO L82 GeneralOperation]: Start removeDead. Operand has 45 places, 49 transitions, 105 flow [2025-03-04 10:02:11,009 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 43 places, 47 transitions, 100 flow [2025-03-04 10:02:11,016 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:02:11,024 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;@9605319, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:02:11,024 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 10:02:11,027 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 10:02:11,027 INFO L124 PetriNetUnfolderBase]: 2/9 cut-off events. [2025-03-04 10:02:11,027 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 10:02:11,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:11,028 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 10:02:11,028 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:11,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:11,033 INFO L85 PathProgramCache]: Analyzing trace with hash 7436017, now seen corresponding path program 1 times [2025-03-04 10:02:11,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:11,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088210412] [2025-03-04 10:02:11,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:11,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:11,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 10:02:11,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 10:02:11,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:11,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:11,237 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 10:02:11,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:11,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088210412] [2025-03-04 10:02:11,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088210412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:11,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:11,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:02:11,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514370248] [2025-03-04 10:02:11,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:11,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:11,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:11,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:11,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:11,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-04 10:02:11,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 10:02:11,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:11,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-04 10:02:11,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:11,395 INFO L124 PetriNetUnfolderBase]: 63/197 cut-off events. [2025-03-04 10:02:11,396 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 10:02:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 197 events. 63/197 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 886 event pairs, 54 based on Foata normal form. 50/235 useless extension candidates. Maximal degree in co-relation 332. Up to 127 conditions per place. [2025-03-04 10:02:11,400 INFO L140 encePairwiseOnDemand]: 38/49 looper letters, 26 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2025-03-04 10:02:11,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 148 flow [2025-03-04 10:02:11,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:11,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:11,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2025-03-04 10:02:11,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.564625850340136 [2025-03-04 10:02:11,412 INFO L175 Difference]: Start difference. First operand has 43 places, 47 transitions, 100 flow. Second operand 3 states and 83 transitions. [2025-03-04 10:02:11,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 148 flow [2025-03-04 10:02:11,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:11,418 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 74 flow [2025-03-04 10:02:11,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-03-04 10:02:11,424 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -7 predicate places. [2025-03-04 10:02:11,424 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 74 flow [2025-03-04 10:02:11,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 10:02:11,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:11,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:11,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:02:11,425 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:11,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:11,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1508836579, now seen corresponding path program 1 times [2025-03-04 10:02:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:11,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182907099] [2025-03-04 10:02:11,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:11,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:02:11,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:02:11,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:11,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:11,579 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 10:02:11,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:11,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182907099] [2025-03-04 10:02:11,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182907099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:11,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:11,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:02:11,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782998838] [2025-03-04 10:02:11,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:11,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:11,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:11,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:11,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:11,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-04 10:02:11,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 10:02:11,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:11,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-04 10:02:11,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:11,678 INFO L124 PetriNetUnfolderBase]: 60/184 cut-off events. [2025-03-04 10:02:11,679 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-04 10:02:11,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 184 events. 60/184 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 755 event pairs, 20 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 205. Up to 75 conditions per place. [2025-03-04 10:02:11,680 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 31 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-03-04 10:02:11,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 47 transitions, 182 flow [2025-03-04 10:02:11,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:02:11,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:02:11,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-03-04 10:02:11,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4530612244897959 [2025-03-04 10:02:11,684 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 74 flow. Second operand 5 states and 111 transitions. [2025-03-04 10:02:11,685 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 47 transitions, 182 flow [2025-03-04 10:02:11,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 47 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 10:02:11,687 INFO L231 Difference]: Finished difference. Result has 39 places, 34 transitions, 112 flow [2025-03-04 10:02:11,687 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=34} [2025-03-04 10:02:11,688 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -4 predicate places. [2025-03-04 10:02:11,688 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 34 transitions, 112 flow [2025-03-04 10:02:11,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 10:02:11,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:11,689 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:11,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:02:11,689 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:11,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:11,689 INFO L85 PathProgramCache]: Analyzing trace with hash 1328254209, now seen corresponding path program 1 times [2025-03-04 10:02:11,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:11,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015704723] [2025-03-04 10:02:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:11,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:11,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 10:02:11,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 10:02:11,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:11,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:11,780 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 10:02:11,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:11,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015704723] [2025-03-04 10:02:11,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015704723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:11,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:11,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:02:11,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871960081] [2025-03-04 10:02:11,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:11,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:02:11,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:11,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:02:11,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:02:11,786 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-04 10:02:11,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 10:02:11,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:11,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-04 10:02:11,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:11,874 INFO L124 PetriNetUnfolderBase]: 54/159 cut-off events. [2025-03-04 10:02:11,874 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2025-03-04 10:02:11,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 371 conditions, 159 events. 54/159 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 590 event pairs, 21 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 125. Up to 74 conditions per place. [2025-03-04 10:02:11,875 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 30 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2025-03-04 10:02:11,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 47 transitions, 224 flow [2025-03-04 10:02:11,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:02:11,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 10:02:11,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2025-03-04 10:02:11,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43673469387755104 [2025-03-04 10:02:11,878 INFO L175 Difference]: Start difference. First operand has 39 places, 34 transitions, 112 flow. Second operand 5 states and 107 transitions. [2025-03-04 10:02:11,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 47 transitions, 224 flow [2025-03-04 10:02:11,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 219 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:11,880 INFO L231 Difference]: Finished difference. Result has 44 places, 35 transitions, 136 flow [2025-03-04 10:02:11,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=136, PETRI_PLACES=44, PETRI_TRANSITIONS=35} [2025-03-04 10:02:11,880 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2025-03-04 10:02:11,880 INFO L471 AbstractCegarLoop]: Abstraction has has 44 places, 35 transitions, 136 flow [2025-03-04 10:02:11,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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 10:02:11,881 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:11,881 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:11,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 10:02:11,882 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:11,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:11,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1942473320, now seen corresponding path program 1 times [2025-03-04 10:02:11,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:11,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076422211] [2025-03-04 10:02:11,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:11,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:11,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 10:02:11,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 10:02:11,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:11,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:11,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:02:11,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:11,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076422211] [2025-03-04 10:02:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076422211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:02:11,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131436419] [2025-03-04 10:02:11,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:11,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:11,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:11,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:11,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:11,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 49 [2025-03-04 10:02:11,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 35 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 10:02:11,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:11,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 49 [2025-03-04 10:02:11,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:11,992 INFO L124 PetriNetUnfolderBase]: 17/81 cut-off events. [2025-03-04 10:02:11,993 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2025-03-04 10:02:11,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 81 events. 17/81 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 203 event pairs, 5 based on Foata normal form. 7/88 useless extension candidates. Maximal degree in co-relation 97. Up to 38 conditions per place. [2025-03-04 10:02:11,996 INFO L140 encePairwiseOnDemand]: 45/49 looper letters, 20 selfloop transitions, 4 changer transitions 0/37 dead transitions. [2025-03-04 10:02:11,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 37 transitions, 182 flow [2025-03-04 10:02:11,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:11,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 10:02:11,999 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48299319727891155 [2025-03-04 10:02:11,999 INFO L175 Difference]: Start difference. First operand has 44 places, 35 transitions, 136 flow. Second operand 3 states and 71 transitions. [2025-03-04 10:02:11,999 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 37 transitions, 182 flow [2025-03-04 10:02:12,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 37 transitions, 170 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 10:02:12,002 INFO L231 Difference]: Finished difference. Result has 43 places, 34 transitions, 124 flow [2025-03-04 10:02:12,002 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=43, PETRI_TRANSITIONS=34} [2025-03-04 10:02:12,002 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 0 predicate places. [2025-03-04 10:02:12,003 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 34 transitions, 124 flow [2025-03-04 10:02:12,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 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 10:02:12,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:12,003 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:12,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 10:02:12,003 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:12,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1988484676, now seen corresponding path program 1 times [2025-03-04 10:02:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:12,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055133442] [2025-03-04 10:02:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:12,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 10:02:12,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 10:02:12,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:12,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:12,107 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 10:02:12,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:12,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055133442] [2025-03-04 10:02:12,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055133442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:12,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:12,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:02:12,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827909766] [2025-03-04 10:02:12,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:12,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:12,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:12,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:12,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:12,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-04 10:02:12,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 34 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 10:02:12,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:12,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-04 10:02:12,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:12,176 INFO L124 PetriNetUnfolderBase]: 19/79 cut-off events. [2025-03-04 10:02:12,177 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 10:02:12,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 79 events. 19/79 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 165 event pairs, 9 based on Foata normal form. 1/80 useless extension candidates. Maximal degree in co-relation 108. Up to 28 conditions per place. [2025-03-04 10:02:12,177 INFO L140 encePairwiseOnDemand]: 42/49 looper letters, 22 selfloop transitions, 8 changer transitions 0/38 dead transitions. [2025-03-04 10:02:12,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 38 transitions, 197 flow [2025-03-04 10:02:12,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:02:12,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 10:02:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 112 transitions. [2025-03-04 10:02:12,179 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38095238095238093 [2025-03-04 10:02:12,179 INFO L175 Difference]: Start difference. First operand has 43 places, 34 transitions, 124 flow. Second operand 6 states and 112 transitions. [2025-03-04 10:02:12,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 38 transitions, 197 flow [2025-03-04 10:02:12,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 38 transitions, 191 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 10:02:12,180 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 137 flow [2025-03-04 10:02:12,180 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=137, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2025-03-04 10:02:12,181 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-04 10:02:12,181 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 137 flow [2025-03-04 10:02:12,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 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 10:02:12,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:12,181 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:12,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 10:02:12,181 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:12,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash -2109574995, now seen corresponding path program 1 times [2025-03-04 10:02:12,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:12,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886100532] [2025-03-04 10:02:12,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:12,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:12,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 10:02:12,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 10:02:12,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:12,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:12,272 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 10:02:12,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:12,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886100532] [2025-03-04 10:02:12,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886100532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:12,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:12,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 10:02:12,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941422471] [2025-03-04 10:02:12,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:12,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:02:12,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:12,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:02:12,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:02:12,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 49 [2025-03-04 10:02:12,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 10:02:12,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:12,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 49 [2025-03-04 10:02:12,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:12,352 INFO L124 PetriNetUnfolderBase]: 17/78 cut-off events. [2025-03-04 10:02:12,353 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 10:02:12,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 216 conditions, 78 events. 17/78 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 147 event pairs, 4 based on Foata normal form. 2/80 useless extension candidates. Maximal degree in co-relation 110. Up to 15 conditions per place. [2025-03-04 10:02:12,353 INFO L140 encePairwiseOnDemand]: 41/49 looper letters, 27 selfloop transitions, 9 changer transitions 0/42 dead transitions. [2025-03-04 10:02:12,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 236 flow [2025-03-04 10:02:12,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 10:02:12,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 10:02:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2025-03-04 10:02:12,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38010204081632654 [2025-03-04 10:02:12,357 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 137 flow. Second operand 8 states and 149 transitions. [2025-03-04 10:02:12,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 236 flow [2025-03-04 10:02:12,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 10:02:12,360 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 138 flow [2025-03-04 10:02:12,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2025-03-04 10:02:12,361 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2025-03-04 10:02:12,361 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 138 flow [2025-03-04 10:02:12,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 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 10:02:12,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 10:02:12,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:12,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 10:02:12,361 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (and 5 more)] === [2025-03-04 10:02:12,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:02:12,362 INFO L85 PathProgramCache]: Analyzing trace with hash 572026158, now seen corresponding path program 1 times [2025-03-04 10:02:12,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:02:12,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544723978] [2025-03-04 10:02:12,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:02:12,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:02:12,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 10:02:12,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 10:02:12,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:02:12,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:02:12,389 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 10:02:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:02:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544723978] [2025-03-04 10:02:12,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544723978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:02:12,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:02:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 10:02:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417453689] [2025-03-04 10:02:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:02:12,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 10:02:12,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:02:12,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 10:02:12,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 10:02:12,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 49 [2025-03-04 10:02:12,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 10:02:12,391 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 10:02:12,391 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 49 [2025-03-04 10:02:12,391 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 10:02:12,414 INFO L124 PetriNetUnfolderBase]: 15/74 cut-off events. [2025-03-04 10:02:12,414 INFO L125 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-03-04 10:02:12,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 74 events. 15/74 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 148 event pairs, 15 based on Foata normal form. 2/76 useless extension candidates. Maximal degree in co-relation 110. Up to 57 conditions per place. [2025-03-04 10:02:12,414 INFO L140 encePairwiseOnDemand]: 47/49 looper letters, 0 selfloop transitions, 0 changer transitions 29/29 dead transitions. [2025-03-04 10:02:12,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 29 transitions, 178 flow [2025-03-04 10:02:12,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 10:02:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 10:02:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-03-04 10:02:12,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4217687074829932 [2025-03-04 10:02:12,416 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 138 flow. Second operand 3 states and 62 transitions. [2025-03-04 10:02:12,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 29 transitions, 178 flow [2025-03-04 10:02:12,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 29 transitions, 160 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 10:02:12,417 INFO L231 Difference]: Finished difference. Result has 40 places, 0 transitions, 0 flow [2025-03-04 10:02:12,418 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=49, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=40, PETRI_TRANSITIONS=0} [2025-03-04 10:02:12,418 INFO L279 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2025-03-04 10:02:12,418 INFO L471 AbstractCegarLoop]: Abstraction has has 40 places, 0 transitions, 0 flow [2025-03-04 10:02:12,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (6 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (5 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONMEMORY_LEAK (3 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (2 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONMEMORY_LEAK (1 of 8 remaining) [2025-03-04 10:02:12,420 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 8 remaining) [2025-03-04 10:02:12,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 10:02:12,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:02:12,424 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 10:02:12,424 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:02:12,427 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:02:12 BasicIcfg [2025-03-04 10:02:12,427 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:02:12,427 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:02:12,427 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:02:12,428 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:02:12,428 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:02:10" (3/4) ... [2025-03-04 10:02:12,429 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:02:12,431 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-04 10:02:12,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-03-04 10:02:12,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:02:12,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 10:02:12,434 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 10:02:12,487 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:02:12,487 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:02:12,487 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:02:12,488 INFO L158 Benchmark]: Toolchain (without parser) took 2313.67ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 104.3MB in the end (delta: -177.5kB). Peak memory consumption was 68.8MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,488 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:02:12,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 349.00ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.0MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.33ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,488 INFO L158 Benchmark]: Boogie Preprocessor took 21.02ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:02:12,488 INFO L158 Benchmark]: IcfgBuilder took 322.60ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 58.8MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,489 INFO L158 Benchmark]: TraceAbstraction took 1529.23ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 42.8MB in the end (delta: 15.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,489 INFO L158 Benchmark]: Witness Printer took 59.70ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 104.3MB in the end (delta: -61.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. [2025-03-04 10:02:12,490 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.15ms. Allocated memory is still 201.3MB. Free memory is still 126.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 349.00ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 85.0MB in the end (delta: 19.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.33ms. Allocated memory is still 142.6MB. Free memory was 85.0MB in the beginning and 82.8MB in the end (delta: 2.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.02ms. Allocated memory is still 142.6MB. Free memory was 82.8MB in the beginning and 81.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 322.60ms. Allocated memory is still 142.6MB. Free memory was 81.8MB in the beginning and 58.8MB in the end (delta: 23.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1529.23ms. Allocated memory is still 142.6MB. Free memory was 58.8MB in the beginning and 42.8MB in the end (delta: 15.9MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 59.70ms. Allocated memory is still 142.6MB. Free memory was 42.8MB in the beginning and 104.3MB in the end (delta: -61.5MB). Peak memory consumption was 8.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 697]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 18]: 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 3 procedures, 61 locations, 8 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 376 IncrementalHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1 mSDtfsCounter, 376 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=6, InterpolantAutomatonStates: 33, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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 5 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 10:02:12,500 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