./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_6.c -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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:14:35,653 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:14:35,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-08 23:14:35,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:14:35,712 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:14:35,731 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:14:35,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:14:35,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:14:35,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:14:35,732 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:14:35,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:14:35,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:14:35,733 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:14:35,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:35,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:14:35,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:14:35,735 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:14:35,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:14:35,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:14:35,735 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:14:35,735 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2025-03-08 23:14:35,980 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:14:35,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:14:35,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:14:35,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:14:35,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:14:35,989 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2025-03-08 23:14:37,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ddccd25/f29c6ad6ea4b4c908383f64ccd393f0b/FLAGb6ac9e1d8 [2025-03-08 23:14:37,380 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:14:37,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2025-03-08 23:14:37,390 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ddccd25/f29c6ad6ea4b4c908383f64ccd393f0b/FLAGb6ac9e1d8 [2025-03-08 23:14:37,734 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ddccd25/f29c6ad6ea4b4c908383f64ccd393f0b [2025-03-08 23:14:37,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:14:37,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:14:37,738 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:37,738 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:14:37,741 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:14:37,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eff42a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37, skipping insertion in model container [2025-03-08 23:14:37,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,752 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:14:37,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:37,864 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:14:37,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:37,891 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:14:37,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37 WrapperNode [2025-03-08 23:14:37,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:37,893 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:37,893 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:14:37,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:14:37,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,916 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2025-03-08 23:14:37,916 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:37,917 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:14:37,917 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:14:37,917 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:14:37,924 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,924 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,925 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,936 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-08 23:14:37,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,942 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,946 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,947 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,948 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:14:37,949 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:14:37,949 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:14:37,952 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:14:37,953 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (1/1) ... [2025-03-08 23:14:37,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:37,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:14:37,981 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 23:14:37,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 23:14:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:14:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:14:38,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:14:38,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:14:38,052 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:14:38,054 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:14:38,185 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-08 23:14:38,186 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:14:38,197 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:14:38,197 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:14:38,198 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:38 BoogieIcfgContainer [2025-03-08 23:14:38,198 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:14:38,200 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:14:38,200 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:14:38,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:14:38,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:14:37" (1/3) ... [2025-03-08 23:14:38,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b9473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:38, skipping insertion in model container [2025-03-08 23:14:38,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:37" (2/3) ... [2025-03-08 23:14:38,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b9473 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:38, skipping insertion in model container [2025-03-08 23:14:38,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:38" (3/3) ... [2025-03-08 23:14:38,206 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2025-03-08 23:14:38,218 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:14:38,220 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_6.c that has 1 procedures, 31 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 23:14:38,254 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:14:38,264 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;@594da365, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:14:38,265 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 23:14:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:14:38,274 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,274 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:14:38,274 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 96351070, now seen corresponding path program 1 times [2025-03-08 23:14:38,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104514510] [2025-03-08 23:14:38,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:14:38,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:14:38,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104514510] [2025-03-08 23:14:38,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104514510] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:38,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636613397] [2025-03-08 23:14:38,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:14:38,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:14:38,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:14:38,419 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 30 states have internal predecessors, (50), 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) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,428 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. [2025-03-08 23:14:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:14:38,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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) Word has length 5 [2025-03-08 23:14:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,435 INFO L225 Difference]: With dead ends: 30 [2025-03-08 23:14:38,435 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 23:14:38,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:14:38,439 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 23:14:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 23:14:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2025-03-08 23:14:38,467 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 5 [2025-03-08 23:14:38,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,467 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2025-03-08 23:14:38,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,468 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2025-03-08 23:14:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:14:38,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,468 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:14:38,469 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1308058922, now seen corresponding path program 1 times [2025-03-08 23:14:38,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951324899] [2025-03-08 23:14:38,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:14:38,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:14:38,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951324899] [2025-03-08 23:14:38,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951324899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:38,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231679316] [2025-03-08 23:14:38,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,541 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,541 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,549 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2025-03-08 23:14:38,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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) Word has length 6 [2025-03-08 23:14:38,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,554 INFO L225 Difference]: With dead ends: 27 [2025-03-08 23:14:38,554 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 23:14:38,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,554 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 23:14:38,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-08 23:14:38,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2025-03-08 23:14:38,559 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 6 [2025-03-08 23:14:38,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,560 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2025-03-08 23:14:38,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,560 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2025-03-08 23:14:38,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:14:38,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,561 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:14:38,561 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1987219413, now seen corresponding path program 1 times [2025-03-08 23:14:38,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735931631] [2025-03-08 23:14:38,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:14:38,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:14:38,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735931631] [2025-03-08 23:14:38,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735931631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451831307] [2025-03-08 23:14:38,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,623 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,643 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2025-03-08 23:14:38,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2025-03-08 23:14:38,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,645 INFO L225 Difference]: With dead ends: 47 [2025-03-08 23:14:38,646 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 23:14:38,646 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,646 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 23:14:38,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2025-03-08 23:14:38,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 55 transitions. [2025-03-08 23:14:38,653 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 55 transitions. Word has length 14 [2025-03-08 23:14:38,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,654 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 55 transitions. [2025-03-08 23:14:38,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,655 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2025-03-08 23:14:38,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 23:14:38,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,655 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:14:38,656 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1790705908, now seen corresponding path program 1 times [2025-03-08 23:14:38,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834875761] [2025-03-08 23:14:38,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 23:14:38,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 23:14:38,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834875761] [2025-03-08 23:14:38,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834875761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522543507] [2025-03-08 23:14:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,710 INFO L87 Difference]: Start difference. First operand 32 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,721 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2025-03-08 23:14:38,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 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) Word has length 14 [2025-03-08 23:14:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,722 INFO L225 Difference]: With dead ends: 47 [2025-03-08 23:14:38,722 INFO L226 Difference]: Without dead ends: 47 [2025-03-08 23:14:38,722 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,723 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-08 23:14:38,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-03-08 23:14:38,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 75 transitions. [2025-03-08 23:14:38,726 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 75 transitions. Word has length 14 [2025-03-08 23:14:38,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,727 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 75 transitions. [2025-03-08 23:14:38,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,728 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2025-03-08 23:14:38,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 23:14:38,728 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,728 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:14:38,728 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1475095765, now seen corresponding path program 1 times [2025-03-08 23:14:38,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122473673] [2025-03-08 23:14:38,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 23:14:38,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 23:14:38,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122473673] [2025-03-08 23:14:38,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122473673] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415109364] [2025-03-08 23:14:38,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,788 INFO L87 Difference]: Start difference. First operand 44 states and 75 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,801 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2025-03-08 23:14:38,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-03-08 23:14:38,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,802 INFO L225 Difference]: With dead ends: 50 [2025-03-08 23:14:38,802 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 23:14:38,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,803 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 23:14:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-08 23:14:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. [2025-03-08 23:14:38,808 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 15 [2025-03-08 23:14:38,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,808 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. [2025-03-08 23:14:38,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,808 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. [2025-03-08 23:14:38,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 23:14:38,809 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:14:38,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,809 INFO L85 PathProgramCache]: Analyzing trace with hash -321855594, now seen corresponding path program 1 times [2025-03-08 23:14:38,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122909385] [2025-03-08 23:14:38,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 23:14:38,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 23:14:38,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122909385] [2025-03-08 23:14:38,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122909385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595366317] [2025-03-08 23:14:38,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,848 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,858 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2025-03-08 23:14:38,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-03-08 23:14:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,859 INFO L225 Difference]: With dead ends: 85 [2025-03-08 23:14:38,859 INFO L226 Difference]: Without dead ends: 85 [2025-03-08 23:14:38,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,860 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-08 23:14:38,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2025-03-08 23:14:38,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 102 transitions. [2025-03-08 23:14:38,864 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 102 transitions. Word has length 15 [2025-03-08 23:14:38,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,864 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 102 transitions. [2025-03-08 23:14:38,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,864 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 102 transitions. [2025-03-08 23:14:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 23:14:38,864 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,864 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:14:38,865 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,865 INFO L85 PathProgramCache]: Analyzing trace with hash -518369099, now seen corresponding path program 1 times [2025-03-08 23:14:38,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479995224] [2025-03-08 23:14:38,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 23:14:38,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 23:14:38,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479995224] [2025-03-08 23:14:38,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479995224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749733075] [2025-03-08 23:14:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,912 INFO L87 Difference]: Start difference. First operand 62 states and 102 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:38,931 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2025-03-08 23:14:38,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:38,931 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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) Word has length 15 [2025-03-08 23:14:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:38,931 INFO L225 Difference]: With dead ends: 87 [2025-03-08 23:14:38,932 INFO L226 Difference]: Without dead ends: 87 [2025-03-08 23:14:38,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,932 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:38,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:38,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-08 23:14:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-08 23:14:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2025-03-08 23:14:38,941 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 15 [2025-03-08 23:14:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:38,942 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2025-03-08 23:14:38,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:38,942 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2025-03-08 23:14:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:14:38,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:38,942 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:38,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:14:38,945 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1386759443, now seen corresponding path program 1 times [2025-03-08 23:14:38,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:38,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329999083] [2025-03-08 23:14:38,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:38,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:38,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:14:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:14:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329999083] [2025-03-08 23:14:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329999083] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:38,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:38,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:38,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107148571] [2025-03-08 23:14:38,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:38,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:38,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:38,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:38,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:38,991 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,001 INFO L93 Difference]: Finished difference Result 89 states and 138 transitions. [2025-03-08 23:14:39,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2025-03-08 23:14:39,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,002 INFO L225 Difference]: With dead ends: 89 [2025-03-08 23:14:39,002 INFO L226 Difference]: Without dead ends: 89 [2025-03-08 23:14:39,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,003 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-08 23:14:39,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-03-08 23:14:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2025-03-08 23:14:39,007 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 16 [2025-03-08 23:14:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,007 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2025-03-08 23:14:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,007 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2025-03-08 23:14:39,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:14:39,007 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,007 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:14:39,008 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1111256494, now seen corresponding path program 1 times [2025-03-08 23:14:39,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409986743] [2025-03-08 23:14:39,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:14:39,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:14:39,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409986743] [2025-03-08 23:14:39,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409986743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57435048] [2025-03-08 23:14:39,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,037 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,061 INFO L93 Difference]: Finished difference Result 153 states and 242 transitions. [2025-03-08 23:14:39,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2025-03-08 23:14:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,062 INFO L225 Difference]: With dead ends: 153 [2025-03-08 23:14:39,062 INFO L226 Difference]: Without dead ends: 153 [2025-03-08 23:14:39,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,062 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-08 23:14:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 118. [2025-03-08 23:14:39,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2025-03-08 23:14:39,071 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 16 [2025-03-08 23:14:39,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,071 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2025-03-08 23:14:39,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,072 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2025-03-08 23:14:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-08 23:14:39,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:14:39,072 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,073 INFO L85 PathProgramCache]: Analyzing trace with hash 914742989, now seen corresponding path program 1 times [2025-03-08 23:14:39,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188426281] [2025-03-08 23:14:39,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-08 23:14:39,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-08 23:14:39,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188426281] [2025-03-08 23:14:39,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188426281] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409918884] [2025-03-08 23:14:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,111 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,124 INFO L93 Difference]: Finished difference Result 161 states and 242 transitions. [2025-03-08 23:14:39,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2025-03-08 23:14:39,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,125 INFO L225 Difference]: With dead ends: 161 [2025-03-08 23:14:39,125 INFO L226 Difference]: Without dead ends: 161 [2025-03-08 23:14:39,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,126 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-08 23:14:39,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-03-08 23:14:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2025-03-08 23:14:39,138 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 16 [2025-03-08 23:14:39,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,138 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2025-03-08 23:14:39,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,138 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2025-03-08 23:14:39,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:14:39,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,139 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:14:39,139 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 90035598, now seen corresponding path program 1 times [2025-03-08 23:14:39,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554580607] [2025-03-08 23:14:39,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:14:39,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:14:39,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554580607] [2025-03-08 23:14:39,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554580607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885046696] [2025-03-08 23:14:39,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,174 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,187 INFO L93 Difference]: Finished difference Result 165 states and 242 transitions. [2025-03-08 23:14:39,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2025-03-08 23:14:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,189 INFO L225 Difference]: With dead ends: 165 [2025-03-08 23:14:39,189 INFO L226 Difference]: Without dead ends: 165 [2025-03-08 23:14:39,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,190 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-08 23:14:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-03-08 23:14:39,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2025-03-08 23:14:39,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 17 [2025-03-08 23:14:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,200 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2025-03-08 23:14:39,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,200 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2025-03-08 23:14:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:14:39,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,208 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:14:39,208 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1706915761, now seen corresponding path program 1 times [2025-03-08 23:14:39,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460327681] [2025-03-08 23:14:39,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:14:39,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:14:39,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460327681] [2025-03-08 23:14:39,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460327681] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316237940] [2025-03-08 23:14:39,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,236 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,244 INFO L93 Difference]: Finished difference Result 281 states and 414 transitions. [2025-03-08 23:14:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2025-03-08 23:14:39,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,246 INFO L225 Difference]: With dead ends: 281 [2025-03-08 23:14:39,246 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 23:14:39,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,246 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 23:14:39,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2025-03-08 23:14:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-03-08 23:14:39,252 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 17 [2025-03-08 23:14:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,253 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-03-08 23:14:39,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-03-08 23:14:39,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:14:39,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:14:39,254 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1903429266, now seen corresponding path program 1 times [2025-03-08 23:14:39,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963015508] [2025-03-08 23:14:39,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:14:39,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:14:39,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963015508] [2025-03-08 23:14:39,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963015508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817611995] [2025-03-08 23:14:39,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,276 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,284 INFO L93 Difference]: Finished difference Result 305 states and 422 transitions. [2025-03-08 23:14:39,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) Word has length 17 [2025-03-08 23:14:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,286 INFO L225 Difference]: With dead ends: 305 [2025-03-08 23:14:39,286 INFO L226 Difference]: Without dead ends: 305 [2025-03-08 23:14:39,286 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,287 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-08 23:14:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2025-03-08 23:14:39,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-08 23:14:39,300 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 17 [2025-03-08 23:14:39,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,300 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-08 23:14:39,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,300 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-08 23:14:39,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:39,301 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,301 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:14:39,301 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1373965114, now seen corresponding path program 1 times [2025-03-08 23:14:39,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146692103] [2025-03-08 23:14:39,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:39,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:39,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146692103] [2025-03-08 23:14:39,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146692103] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664396925] [2025-03-08 23:14:39,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,326 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,334 INFO L93 Difference]: Finished difference Result 313 states and 422 transitions. [2025-03-08 23:14:39,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,335 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2025-03-08 23:14:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,336 INFO L225 Difference]: With dead ends: 313 [2025-03-08 23:14:39,337 INFO L226 Difference]: Without dead ends: 313 [2025-03-08 23:14:39,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,338 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-08 23:14:39,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2025-03-08 23:14:39,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2025-03-08 23:14:39,346 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 18 [2025-03-08 23:14:39,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,346 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2025-03-08 23:14:39,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,346 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2025-03-08 23:14:39,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:39,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:14:39,347 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1124050823, now seen corresponding path program 1 times [2025-03-08 23:14:39,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656628373] [2025-03-08 23:14:39,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:39,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,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-08 23:14:39,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656628373] [2025-03-08 23:14:39,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656628373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424990357] [2025-03-08 23:14:39,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,369 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,379 INFO L93 Difference]: Finished difference Result 521 states and 694 transitions. [2025-03-08 23:14:39,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2025-03-08 23:14:39,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,381 INFO L225 Difference]: With dead ends: 521 [2025-03-08 23:14:39,381 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 23:14:39,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,382 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 23:14:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 454. [2025-03-08 23:14:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 596 transitions. [2025-03-08 23:14:39,391 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 596 transitions. Word has length 18 [2025-03-08 23:14:39,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,392 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 596 transitions. [2025-03-08 23:14:39,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,392 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 596 transitions. [2025-03-08 23:14:39,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:39,392 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,392 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:14:39,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,393 INFO L85 PathProgramCache]: Analyzing trace with hash 927537318, now seen corresponding path program 1 times [2025-03-08 23:14:39,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452609548] [2025-03-08 23:14:39,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:39,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:39,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452609548] [2025-03-08 23:14:39,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452609548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952095167] [2025-03-08 23:14:39,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,419 INFO L87 Difference]: Start difference. First operand 454 states and 596 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,431 INFO L93 Difference]: Finished difference Result 585 states and 726 transitions. [2025-03-08 23:14:39,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) Word has length 18 [2025-03-08 23:14:39,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,433 INFO L225 Difference]: With dead ends: 585 [2025-03-08 23:14:39,433 INFO L226 Difference]: Without dead ends: 585 [2025-03-08 23:14:39,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,434 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-08 23:14:39,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2025-03-08 23:14:39,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 724 transitions. [2025-03-08 23:14:39,452 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 724 transitions. Word has length 18 [2025-03-08 23:14:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,452 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 724 transitions. [2025-03-08 23:14:39,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,452 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 724 transitions. [2025-03-08 23:14:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:39,453 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:14:39,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,453 INFO L85 PathProgramCache]: Analyzing trace with hash 486646343, now seen corresponding path program 1 times [2025-03-08 23:14:39,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14063200] [2025-03-08 23:14:39,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:39,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:39,458 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,458 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14063200] [2025-03-08 23:14:39,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14063200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916206693] [2025-03-08 23:14:39,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,470 INFO L87 Difference]: Start difference. First operand 582 states and 724 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,479 INFO L93 Difference]: Finished difference Result 601 states and 726 transitions. [2025-03-08 23:14:39,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2025-03-08 23:14:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,481 INFO L225 Difference]: With dead ends: 601 [2025-03-08 23:14:39,481 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 23:14:39,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,482 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 23:14:39,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2025-03-08 23:14:39,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 724 transitions. [2025-03-08 23:14:39,507 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 724 transitions. Word has length 19 [2025-03-08 23:14:39,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,507 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 724 transitions. [2025-03-08 23:14:39,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,507 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 724 transitions. [2025-03-08 23:14:39,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:39,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:14:39,509 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1310305016, now seen corresponding path program 1 times [2025-03-08 23:14:39,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455228995] [2025-03-08 23:14:39,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:39,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:39,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455228995] [2025-03-08 23:14:39,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455228995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277623182] [2025-03-08 23:14:39,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,540 INFO L87 Difference]: Start difference. First operand 598 states and 724 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,554 INFO L93 Difference]: Finished difference Result 966 states and 1124 transitions. [2025-03-08 23:14:39,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2025-03-08 23:14:39,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,557 INFO L225 Difference]: With dead ends: 966 [2025-03-08 23:14:39,557 INFO L226 Difference]: Without dead ends: 966 [2025-03-08 23:14:39,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,557 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-08 23:14:39,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 902. [2025-03-08 23:14:39,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1060 transitions. [2025-03-08 23:14:39,572 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1060 transitions. Word has length 19 [2025-03-08 23:14:39,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,572 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1060 transitions. [2025-03-08 23:14:39,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,572 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1060 transitions. [2025-03-08 23:14:39,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:39,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:39,573 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 23:14:39,573 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:39,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:39,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1506818521, now seen corresponding path program 1 times [2025-03-08 23:14:39,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:39,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455320249] [2025-03-08 23:14:39,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:39,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:39,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:39,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:39,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:39,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 23:14:39,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:39,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455320249] [2025-03-08 23:14:39,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455320249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:39,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:39,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:39,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267654381] [2025-03-08 23:14:39,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:39,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:39,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:39,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:39,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,600 INFO L87 Difference]: Start difference. First operand 902 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:39,617 INFO L93 Difference]: Finished difference Result 1123 states and 1218 transitions. [2025-03-08 23:14:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:39,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) Word has length 19 [2025-03-08 23:14:39,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:39,618 INFO L225 Difference]: With dead ends: 1123 [2025-03-08 23:14:39,618 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 23:14:39,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:39,618 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 23:14:39,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 23:14:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 23:14:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 23:14:39,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 23:14:39,619 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2025-03-08 23:14:39,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:39,619 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 23:14:39,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:39,619 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 23:14:39,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 23:14:39,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-08 23:14:39,622 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-08 23:14:39,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:14:39,625 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:39,627 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:14:39,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:14:39 BoogieIcfgContainer [2025-03-08 23:14:39,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:14:39,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:14:39,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:14:39,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:14:39,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:38" (3/4) ... [2025-03-08 23:14:39,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 23:14:39,641 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 23:14:39,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 23:14:39,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 23:14:39,642 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:14:39,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 23:14:39,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 23:14:39,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:14:39,701 INFO L158 Benchmark]: Toolchain (without parser) took 1964.85ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 86.6MB in the end (delta: 25.7MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 154.58ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.11ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: Boogie Preprocessor took 31.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.5MB in the end (delta: 893.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: IcfgBuilder took 249.08ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 85.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 23:14:39,702 INFO L158 Benchmark]: TraceAbstraction took 1429.74ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 93.2MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:39,703 INFO L158 Benchmark]: Witness Printer took 71.03ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 86.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:39,703 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.17ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 154.58ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 100.5MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.11ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.4MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.17ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 98.5MB in the end (delta: 893.9kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 249.08ms. Allocated memory is still 142.6MB. Free memory was 98.5MB in the beginning and 85.9MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1429.74ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 93.2MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 71.03ms. Allocated memory is still 142.6MB. Free memory was 93.2MB in the beginning and 86.6MB in the end (delta: 6.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 50 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 1551 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 980 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=18, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 285 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 23:14:39,717 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