./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:14:16,479 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:14:16,523 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:16,527 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:14:16,527 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:14:16,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:14:16,545 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:14:16,546 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:14:16,546 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:14:16,546 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:14:16,547 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:14:16,547 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:14:16,547 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:14:16,547 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:14:16,548 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:14:16,548 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:14:16,549 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:14:16,549 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:16,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:14:16,550 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:14:16,550 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2025-03-08 23:14:16,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:14:16,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:14:16,788 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:14:16,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:14:16,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:14:16,791 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2025-03-08 23:14:17,954 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ece9cc8/5bd47a9b19be4b8e94a372c2e28533db/FLAGe70c18d17 [2025-03-08 23:14:18,179 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:14:18,180 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2025-03-08 23:14:18,186 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ece9cc8/5bd47a9b19be4b8e94a372c2e28533db/FLAGe70c18d17 [2025-03-08 23:14:18,545 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8ece9cc8/5bd47a9b19be4b8e94a372c2e28533db [2025-03-08 23:14:18,546 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:14:18,547 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:14:18,548 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:18,548 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:14:18,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:14:18,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:18" (1/1) ... [2025-03-08 23:14:18,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d076140 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:18, skipping insertion in model container [2025-03-08 23:14:18,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:18" (1/1) ... [2025-03-08 23:14:18,569 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:14:18,688 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:18,695 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:14:18,718 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:18,731 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:14:18,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:18 WrapperNode [2025-03-08 23:14:18,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:18,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:18,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:14:18,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:14:18,738 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:18" (1/1) ... [2025-03-08 23:14:18,745 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:18" (1/1) ... [2025-03-08 23:14:18,761 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 158 [2025-03-08 23:14:18,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:18,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:14:18,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:14:18,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:14:18,768 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:18" (1/1) ... [2025-03-08 23:14:18,768 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:18" (1/1) ... [2025-03-08 23:14:18,769 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:18" (1/1) ... [2025-03-08 23:14:18,780 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:18,780 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:18" (1/1) ... [2025-03-08 23:14:18,780 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:18" (1/1) ... [2025-03-08 23:14:18,783 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:18" (1/1) ... [2025-03-08 23:14:18,785 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:18" (1/1) ... [2025-03-08 23:14:18,786 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:18" (1/1) ... [2025-03-08 23:14:18,786 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:18" (1/1) ... [2025-03-08 23:14:18,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:14:18,790 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:14:18,790 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:14:18,790 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:14:18,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:18" (1/1) ... [2025-03-08 23:14:18,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:18,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:14:18,820 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:18,826 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:18,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:14:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:14:18,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:14:18,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:14:18,890 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:14:18,892 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:14:19,051 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2025-03-08 23:14:19,051 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:14:19,062 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:14:19,063 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:14:19,063 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:19 BoogieIcfgContainer [2025-03-08 23:14:19,063 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:14:19,065 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:14:19,065 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:14:19,068 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:14:19,069 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:14:18" (1/3) ... [2025-03-08 23:14:19,070 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a025177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:19, skipping insertion in model container [2025-03-08 23:14:19,071 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:18" (2/3) ... [2025-03-08 23:14:19,072 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a025177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:19, skipping insertion in model container [2025-03-08 23:14:19,072 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:19" (3/3) ... [2025-03-08 23:14:19,073 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2025-03-08 23:14:19,084 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:14:19,088 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_11.c that has 1 procedures, 46 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 23:14:19,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:14:19,124 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;@3fab63a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:14:19,124 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 23:14:19,128 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 45 states have internal predecessors, (80), 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:19,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:14:19,132 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,133 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:14:19,133 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,137 INFO L85 PathProgramCache]: Analyzing trace with hash 139293355, now seen corresponding path program 1 times [2025-03-08 23:14:19,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552108699] [2025-03-08 23:14:19,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:14:19,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:14:19,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,243 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:19,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552108699] [2025-03-08 23:14:19,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552108699] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:19,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993425652] [2025-03-08 23:14:19,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:14:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:14:19,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:14:19,270 INFO L87 Difference]: Start difference. First operand has 46 states, 43 states have (on average 1.8604651162790697) internal successors, (80), 45 states have internal predecessors, (80), 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:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,282 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2025-03-08 23:14:19,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:14:19,284 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:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,290 INFO L225 Difference]: With dead ends: 45 [2025-03-08 23:14:19,290 INFO L226 Difference]: Without dead ends: 43 [2025-03-08 23:14:19,292 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:19,296 INFO L435 NwaCegarLoop]: 77 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, 77 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:19,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 77 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:19,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-03-08 23:14:19,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2025-03-08 23:14:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.829268292682927) internal successors, (75), 42 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:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 75 transitions. [2025-03-08 23:14:19,326 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 75 transitions. Word has length 5 [2025-03-08 23:14:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,326 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 75 transitions. [2025-03-08 23:14:19,326 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:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 75 transitions. [2025-03-08 23:14:19,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:14:19,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,328 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:14:19,329 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,330 INFO L85 PathProgramCache]: Analyzing trace with hash 23195158, now seen corresponding path program 1 times [2025-03-08 23:14:19,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553412419] [2025-03-08 23:14:19,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:14:19,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:14:19,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,409 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:19,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553412419] [2025-03-08 23:14:19,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553412419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:19,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85988171] [2025-03-08 23:14:19,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,411 INFO L87 Difference]: Start difference. First operand 43 states and 75 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:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,420 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2025-03-08 23:14:19,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,421 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:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,421 INFO L225 Difference]: With dead ends: 42 [2025-03-08 23:14:19,421 INFO L226 Difference]: Without dead ends: 40 [2025-03-08 23:14:19,421 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:19,422 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 74 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:19,422 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 74 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:19,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-08 23:14:19,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-03-08 23:14:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.8461538461538463) internal successors, (72), 39 states have internal predecessors, (72), 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:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 72 transitions. [2025-03-08 23:14:19,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 72 transitions. Word has length 6 [2025-03-08 23:14:19,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,426 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 72 transitions. [2025-03-08 23:14:19,426 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:19,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 72 transitions. [2025-03-08 23:14:19,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:19,426 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,426 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:19,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:14:19,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1188702877, now seen corresponding path program 1 times [2025-03-08 23:14:19,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780058125] [2025-03-08 23:14:19,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:19,451 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:19,452 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,488 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:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780058125] [2025-03-08 23:14:19,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780058125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755843114] [2025-03-08 23:14:19,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,490 INFO L87 Difference]: Start difference. First operand 40 states and 72 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:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,511 INFO L93 Difference]: Finished difference Result 77 states and 139 transitions. [2025-03-08 23:14:19,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,512 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:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,513 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:14:19,513 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:14:19,513 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:19,513 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 142 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:19,514 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 142 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:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:14:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 52. [2025-03-08 23:14:19,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 51 states have internal predecessors, (95), 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:19,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 95 transitions. [2025-03-08 23:14:19,519 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 95 transitions. Word has length 19 [2025-03-08 23:14:19,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,519 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 95 transitions. [2025-03-08 23:14:19,519 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:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 95 transitions. [2025-03-08 23:14:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:19,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,520 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:19,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:14:19,520 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1598712610, now seen corresponding path program 1 times [2025-03-08 23:14:19,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-08 23:14:19,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:19,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,592 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:19,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145625381] [2025-03-08 23:14:19,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145625381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539948949] [2025-03-08 23:14:19,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,595 INFO L87 Difference]: Start difference. First operand 52 states and 95 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:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,611 INFO L93 Difference]: Finished difference Result 77 states and 137 transitions. [2025-03-08 23:14:19,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,612 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:19,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,612 INFO L225 Difference]: With dead ends: 77 [2025-03-08 23:14:19,612 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 23:14:19,613 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:19,613 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 54 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 159 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:19,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 159 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:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 23:14:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2025-03-08 23:14:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.8493150684931507) internal successors, (135), 73 states have internal predecessors, (135), 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:19,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 135 transitions. [2025-03-08 23:14:19,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 135 transitions. Word has length 19 [2025-03-08 23:14:19,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,622 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 135 transitions. [2025-03-08 23:14:19,623 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:19,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 135 transitions. [2025-03-08 23:14:19,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:19,625 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,625 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:14:19,626 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1804046736, now seen corresponding path program 1 times [2025-03-08 23:14:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731531454] [2025-03-08 23:14:19,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:19,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:19,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,684 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:19,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731531454] [2025-03-08 23:14:19,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731531454] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098888425] [2025-03-08 23:14:19,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,687 INFO L87 Difference]: Start difference. First operand 74 states and 135 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,703 INFO L93 Difference]: Finished difference Result 80 states and 139 transitions. [2025-03-08 23:14:19,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 23:14:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,704 INFO L225 Difference]: With dead ends: 80 [2025-03-08 23:14:19,704 INFO L226 Difference]: Without dead ends: 80 [2025-03-08 23:14:19,704 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:19,704 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 56 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 179 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:19,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 179 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:19,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-08 23:14:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2025-03-08 23:14:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.8026315789473684) internal successors, (137), 76 states have internal predecessors, (137), 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:19,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 137 transitions. [2025-03-08 23:14:19,709 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 137 transitions. Word has length 20 [2025-03-08 23:14:19,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,709 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 137 transitions. [2025-03-08 23:14:19,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,709 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 137 transitions. [2025-03-08 23:14:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:19,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,710 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:14:19,710 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1980386383, now seen corresponding path program 1 times [2025-03-08 23:14:19,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-08 23:14:19,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:19,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:19,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,768 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:19,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165268924] [2025-03-08 23:14:19,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165268924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900472868] [2025-03-08 23:14:19,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,770 INFO L87 Difference]: Start difference. First operand 77 states and 137 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,785 INFO L93 Difference]: Finished difference Result 145 states and 260 transitions. [2025-03-08 23:14:19,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 23:14:19,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,786 INFO L225 Difference]: With dead ends: 145 [2025-03-08 23:14:19,788 INFO L226 Difference]: Without dead ends: 145 [2025-03-08 23:14:19,788 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:19,788 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 140 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:19,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 140 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:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-08 23:14:19,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2025-03-08 23:14:19,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.801980198019802) internal successors, (182), 101 states have internal predecessors, (182), 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:19,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 182 transitions. [2025-03-08 23:14:19,800 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 182 transitions. Word has length 20 [2025-03-08 23:14:19,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,800 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 182 transitions. [2025-03-08 23:14:19,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,800 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 182 transitions. [2025-03-08 23:14:19,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:19,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:14:19,801 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,801 INFO L85 PathProgramCache]: Analyzing trace with hash -807029104, now seen corresponding path program 1 times [2025-03-08 23:14:19,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284228652] [2025-03-08 23:14:19,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:19,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:19,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,833 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:19,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284228652] [2025-03-08 23:14:19,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284228652] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725418971] [2025-03-08 23:14:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,835 INFO L87 Difference]: Start difference. First operand 102 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,854 INFO L93 Difference]: Finished difference Result 147 states and 258 transitions. [2025-03-08 23:14:19,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2025-03-08 23:14:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,855 INFO L225 Difference]: With dead ends: 147 [2025-03-08 23:14:19,855 INFO L226 Difference]: Without dead ends: 147 [2025-03-08 23:14:19,855 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:19,856 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 160 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:19,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 160 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:19,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-03-08 23:14:19,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2025-03-08 23:14:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 143 states have (on average 1.7902097902097902) internal successors, (256), 143 states have internal predecessors, (256), 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:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 256 transitions. [2025-03-08 23:14:19,865 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 256 transitions. Word has length 20 [2025-03-08 23:14:19,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,865 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 256 transitions. [2025-03-08 23:14:19,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 256 transitions. [2025-03-08 23:14:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:19,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,866 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:14:19,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1263298743, now seen corresponding path program 1 times [2025-03-08 23:14:19,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613726200] [2025-03-08 23:14:19,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:19,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:19,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,895 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:19,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613726200] [2025-03-08 23:14:19,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613726200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103050139] [2025-03-08 23:14:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,896 INFO L87 Difference]: Start difference. First operand 144 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,913 INFO L93 Difference]: Finished difference Result 149 states and 258 transitions. [2025-03-08 23:14:19,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 23:14:19,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,914 INFO L225 Difference]: With dead ends: 149 [2025-03-08 23:14:19,914 INFO L226 Difference]: Without dead ends: 149 [2025-03-08 23:14:19,915 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:19,915 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 175 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:19,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 175 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:19,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-03-08 23:14:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-03-08 23:14:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 145 states have (on average 1.7655172413793103) internal successors, (256), 145 states have internal predecessors, (256), 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:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 256 transitions. [2025-03-08 23:14:19,922 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 256 transitions. Word has length 21 [2025-03-08 23:14:19,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,922 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 256 transitions. [2025-03-08 23:14:19,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19,922 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 256 transitions. [2025-03-08 23:14:19,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:19,923 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,923 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:14:19,923 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,923 INFO L85 PathProgramCache]: Analyzing trace with hash 752764566, now seen corresponding path program 1 times [2025-03-08 23:14:19,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-08 23:14:19,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:19,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:19,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:19,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:19,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:19,962 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:19,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:19,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-08 23:14:19,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072519813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:19,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:19,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:19,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948829480] [2025-03-08 23:14:19,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:19,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:19,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:19,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:19,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:19,964 INFO L87 Difference]: Start difference. First operand 146 states and 256 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:19,974 INFO L93 Difference]: Finished difference Result 273 states and 482 transitions. [2025-03-08 23:14:19,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:19,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 23:14:19,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:19,976 INFO L225 Difference]: With dead ends: 273 [2025-03-08 23:14:19,977 INFO L226 Difference]: Without dead ends: 273 [2025-03-08 23:14:19,977 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:19,977 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 48 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 138 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:19,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 138 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:19,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-08 23:14:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 198. [2025-03-08 23:14:19,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 197 states have (on average 1.7461928934010151) internal successors, (344), 197 states have internal predecessors, (344), 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:19,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 344 transitions. [2025-03-08 23:14:19,991 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 344 transitions. Word has length 21 [2025-03-08 23:14:19,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:19,991 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 344 transitions. [2025-03-08 23:14:19,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 344 transitions. [2025-03-08 23:14:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:19,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:19,995 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:19,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:14:19,995 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:19,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2034650921, now seen corresponding path program 1 times [2025-03-08 23:14:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-03-08 23:14:19,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:20,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:20,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,032 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:20,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528474541] [2025-03-08 23:14:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528474541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634742881] [2025-03-08 23:14:20,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,035 INFO L87 Difference]: Start difference. First operand 198 states and 344 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:20,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,044 INFO L93 Difference]: Finished difference Result 281 states and 482 transitions. [2025-03-08 23:14:20,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2025-03-08 23:14:20,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,046 INFO L225 Difference]: With dead ends: 281 [2025-03-08 23:14:20,047 INFO L226 Difference]: Without dead ends: 281 [2025-03-08 23:14:20,047 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:20,047 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 161 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:20,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 161 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:20,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-08 23:14:20,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2025-03-08 23:14:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 1.7328519855595668) internal successors, (480), 277 states have internal predecessors, (480), 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:20,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 480 transitions. [2025-03-08 23:14:20,057 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 480 transitions. Word has length 21 [2025-03-08 23:14:20,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,057 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 480 transitions. [2025-03-08 23:14:20,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:20,058 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 480 transitions. [2025-03-08 23:14:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:20,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:14:20,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1861721353, now seen corresponding path program 1 times [2025-03-08 23:14:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-08 23:14:20,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:20,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:20,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,089 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:20,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551181854] [2025-03-08 23:14:20,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551181854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036473893] [2025-03-08 23:14:20,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,091 INFO L87 Difference]: Start difference. First operand 278 states and 480 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,102 INFO L93 Difference]: Finished difference Result 285 states and 482 transitions. [2025-03-08 23:14:20,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,102 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 23:14:20,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,103 INFO L225 Difference]: With dead ends: 285 [2025-03-08 23:14:20,103 INFO L226 Difference]: Without dead ends: 285 [2025-03-08 23:14:20,103 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:20,104 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 171 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:20,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 171 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:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-08 23:14:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2025-03-08 23:14:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.708185053380783) internal successors, (480), 281 states have internal predecessors, (480), 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:20,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 480 transitions. [2025-03-08 23:14:20,111 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 480 transitions. Word has length 22 [2025-03-08 23:14:20,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,112 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 480 transitions. [2025-03-08 23:14:20,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,112 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 480 transitions. [2025-03-08 23:14:20,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:20,113 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,113 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:14:20,113 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1351187176, now seen corresponding path program 1 times [2025-03-08 23:14:20,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-03-08 23:14:20,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:20,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:20,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,141 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:20,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917970624] [2025-03-08 23:14:20,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917970624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12191414] [2025-03-08 23:14:20,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,142 INFO L87 Difference]: Start difference. First operand 282 states and 480 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,152 INFO L93 Difference]: Finished difference Result 521 states and 894 transitions. [2025-03-08 23:14:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 23:14:20,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,154 INFO L225 Difference]: With dead ends: 521 [2025-03-08 23:14:20,154 INFO L226 Difference]: Without dead ends: 521 [2025-03-08 23:14:20,155 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:20,155 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 45 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 136 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:20,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 136 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:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-08 23:14:20,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 390. [2025-03-08 23:14:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 389 states have (on average 1.6760925449871464) internal successors, (652), 389 states have internal predecessors, (652), 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:20,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 652 transitions. [2025-03-08 23:14:20,163 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 652 transitions. Word has length 22 [2025-03-08 23:14:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,163 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 652 transitions. [2025-03-08 23:14:20,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 652 transitions. [2025-03-08 23:14:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:20,164 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:14:20,164 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1436228311, now seen corresponding path program 1 times [2025-03-08 23:14:20,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-08 23:14:20,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:20,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:20,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,194 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:20,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-08 23:14:20,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464680206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259035135] [2025-03-08 23:14:20,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,196 INFO L87 Difference]: Start difference. First operand 390 states and 652 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,209 INFO L93 Difference]: Finished difference Result 545 states and 902 transitions. [2025-03-08 23:14:20,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,209 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2025-03-08 23:14:20,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,211 INFO L225 Difference]: With dead ends: 545 [2025-03-08 23:14:20,211 INFO L226 Difference]: Without dead ends: 545 [2025-03-08 23:14:20,211 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:20,211 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 162 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:20,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 162 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:20,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2025-03-08 23:14:20,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 542. [2025-03-08 23:14:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 541 states have (on average 1.6635859519408502) internal successors, (900), 541 states have internal predecessors, (900), 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:20,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 900 transitions. [2025-03-08 23:14:20,222 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 900 transitions. Word has length 22 [2025-03-08 23:14:20,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,223 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 900 transitions. [2025-03-08 23:14:20,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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:20,223 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 900 transitions. [2025-03-08 23:14:20,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:20,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,225 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:14:20,225 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1062020944, now seen corresponding path program 1 times [2025-03-08 23:14:20,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-08 23:14:20,226 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:20,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:20,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,280 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:20,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-08 23:14:20,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459864890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003076998] [2025-03-08 23:14:20,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,281 INFO L87 Difference]: Start difference. First operand 542 states and 900 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,292 INFO L93 Difference]: Finished difference Result 553 states and 902 transitions. [2025-03-08 23:14:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 23:14:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,294 INFO L225 Difference]: With dead ends: 553 [2025-03-08 23:14:20,294 INFO L226 Difference]: Without dead ends: 553 [2025-03-08 23:14:20,294 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:20,295 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 53 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 167 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:20,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 167 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:20,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2025-03-08 23:14:20,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 550. [2025-03-08 23:14:20,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 1.639344262295082) internal successors, (900), 549 states have internal predecessors, (900), 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:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 900 transitions. [2025-03-08 23:14:20,305 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 900 transitions. Word has length 23 [2025-03-08 23:14:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,305 INFO L471 AbstractCegarLoop]: Abstraction has 550 states and 900 transitions. [2025-03-08 23:14:20,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 900 transitions. [2025-03-08 23:14:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:20,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,306 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:14:20,306 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1572555121, now seen corresponding path program 1 times [2025-03-08 23:14:20,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671316731] [2025-03-08 23:14:20,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:20,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:20,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,332 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:20,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671316731] [2025-03-08 23:14:20,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671316731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484714977] [2025-03-08 23:14:20,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,333 INFO L87 Difference]: Start difference. First operand 550 states and 900 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,348 INFO L93 Difference]: Finished difference Result 1001 states and 1654 transitions. [2025-03-08 23:14:20,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 23:14:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,352 INFO L225 Difference]: With dead ends: 1001 [2025-03-08 23:14:20,352 INFO L226 Difference]: Without dead ends: 1001 [2025-03-08 23:14:20,352 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:20,354 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 42 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 134 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:20,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 134 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:20,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2025-03-08 23:14:20,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 774. [2025-03-08 23:14:20,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 773 states have (on average 1.5989650711513583) internal successors, (1236), 773 states have internal predecessors, (1236), 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:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1236 transitions. [2025-03-08 23:14:20,368 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1236 transitions. Word has length 23 [2025-03-08 23:14:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1236 transitions. [2025-03-08 23:14:20,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,368 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1236 transitions. [2025-03-08 23:14:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:20,369 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,369 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:14:20,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash -65003312, now seen corresponding path program 1 times [2025-03-08 23:14:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145788223] [2025-03-08 23:14:20,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:20,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:20,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,390 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:20,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145788223] [2025-03-08 23:14:20,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145788223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057773489] [2025-03-08 23:14:20,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,391 INFO L87 Difference]: Start difference. First operand 774 states and 1236 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,406 INFO L93 Difference]: Finished difference Result 1065 states and 1686 transitions. [2025-03-08 23:14:20,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2025-03-08 23:14:20,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,410 INFO L225 Difference]: With dead ends: 1065 [2025-03-08 23:14:20,410 INFO L226 Difference]: Without dead ends: 1065 [2025-03-08 23:14:20,410 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:20,411 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 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:20,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 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:20,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2025-03-08 23:14:20,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1062. [2025-03-08 23:14:20,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 1061 states have (on average 1.587181903864279) internal successors, (1684), 1061 states have internal predecessors, (1684), 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:20,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1684 transitions. [2025-03-08 23:14:20,429 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1684 transitions. Word has length 23 [2025-03-08 23:14:20,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,429 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1684 transitions. [2025-03-08 23:14:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1684 transitions. [2025-03-08 23:14:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:20,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,431 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:14:20,431 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1503725662, now seen corresponding path program 1 times [2025-03-08 23:14:20,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-03-08 23:14:20,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:20,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:20,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,450 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:20,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666249188] [2025-03-08 23:14:20,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666249188] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115564331] [2025-03-08 23:14:20,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,451 INFO L87 Difference]: Start difference. First operand 1062 states and 1684 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,462 INFO L93 Difference]: Finished difference Result 1081 states and 1686 transitions. [2025-03-08 23:14:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,463 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-03-08 23:14:20,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,465 INFO L225 Difference]: With dead ends: 1081 [2025-03-08 23:14:20,465 INFO L226 Difference]: Without dead ends: 1081 [2025-03-08 23:14:20,465 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:20,466 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 163 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:20,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 163 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:20,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2025-03-08 23:14:20,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1078. [2025-03-08 23:14:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1078 states, 1077 states have (on average 1.563602599814299) internal successors, (1684), 1077 states have internal predecessors, (1684), 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:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1078 states to 1078 states and 1684 transitions. [2025-03-08 23:14:20,481 INFO L78 Accepts]: Start accepts. Automaton has 1078 states and 1684 transitions. Word has length 24 [2025-03-08 23:14:20,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,481 INFO L471 AbstractCegarLoop]: Abstraction has 1078 states and 1684 transitions. [2025-03-08 23:14:20,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1078 states and 1684 transitions. [2025-03-08 23:14:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:20,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,482 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:14:20,483 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,483 INFO L85 PathProgramCache]: Analyzing trace with hash -2014259839, now seen corresponding path program 1 times [2025-03-08 23:14:20,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264670910] [2025-03-08 23:14:20,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:20,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:20,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,498 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:20,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264670910] [2025-03-08 23:14:20,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264670910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343462806] [2025-03-08 23:14:20,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,499 INFO L87 Difference]: Start difference. First operand 1078 states and 1684 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,512 INFO L93 Difference]: Finished difference Result 1929 states and 3046 transitions. [2025-03-08 23:14:20,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-03-08 23:14:20,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,518 INFO L225 Difference]: With dead ends: 1929 [2025-03-08 23:14:20,518 INFO L226 Difference]: Without dead ends: 1929 [2025-03-08 23:14:20,518 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:20,519 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 132 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:20,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 132 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:20,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2025-03-08 23:14:20,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1542. [2025-03-08 23:14:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1542 states, 1541 states have (on average 1.5184944841012329) internal successors, (2340), 1541 states have internal predecessors, (2340), 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:20,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1542 states to 1542 states and 2340 transitions. [2025-03-08 23:14:20,543 INFO L78 Accepts]: Start accepts. Automaton has 1542 states and 2340 transitions. Word has length 24 [2025-03-08 23:14:20,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,543 INFO L471 AbstractCegarLoop]: Abstraction has 1542 states and 2340 transitions. [2025-03-08 23:14:20,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1542 states and 2340 transitions. [2025-03-08 23:14:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:20,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 23:14:20,545 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,545 INFO L85 PathProgramCache]: Analyzing trace with hash -506708030, now seen corresponding path program 1 times [2025-03-08 23:14:20,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396638896] [2025-03-08 23:14:20,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:20,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:20,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,571 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:20,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396638896] [2025-03-08 23:14:20,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396638896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885790483] [2025-03-08 23:14:20,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,572 INFO L87 Difference]: Start difference. First operand 1542 states and 2340 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,590 INFO L93 Difference]: Finished difference Result 2089 states and 3142 transitions. [2025-03-08 23:14:20,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2025-03-08 23:14:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,596 INFO L225 Difference]: With dead ends: 2089 [2025-03-08 23:14:20,596 INFO L226 Difference]: Without dead ends: 2089 [2025-03-08 23:14:20,597 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:20,597 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 164 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:20,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 164 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:20,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2025-03-08 23:14:20,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2086. [2025-03-08 23:14:20,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2086 states, 2085 states have (on average 1.5059952038369304) internal successors, (3140), 2085 states have internal predecessors, (3140), 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:20,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2086 states to 2086 states and 3140 transitions. [2025-03-08 23:14:20,629 INFO L78 Accepts]: Start accepts. Automaton has 2086 states and 3140 transitions. Word has length 24 [2025-03-08 23:14:20,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,629 INFO L471 AbstractCegarLoop]: Abstraction has 2086 states and 3140 transitions. [2025-03-08 23:14:20,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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:20,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2086 states and 3140 transitions. [2025-03-08 23:14:20,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:20,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:14:20,632 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1983290537, now seen corresponding path program 1 times [2025-03-08 23:14:20,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632170143] [2025-03-08 23:14:20,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:20,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:20,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,655 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:20,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632170143] [2025-03-08 23:14:20,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632170143] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105143328] [2025-03-08 23:14:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,657 INFO L87 Difference]: Start difference. First operand 2086 states and 3140 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,672 INFO L93 Difference]: Finished difference Result 2121 states and 3142 transitions. [2025-03-08 23:14:20,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,673 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 23:14:20,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,678 INFO L225 Difference]: With dead ends: 2121 [2025-03-08 23:14:20,678 INFO L226 Difference]: Without dead ends: 2121 [2025-03-08 23:14:20,678 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:20,679 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 159 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:20,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 159 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:20,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2025-03-08 23:14:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2118. [2025-03-08 23:14:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2118 states, 2117 states have (on average 1.483230987246103) internal successors, (3140), 2117 states have internal predecessors, (3140), 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:20,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2118 states to 2118 states and 3140 transitions. [2025-03-08 23:14:20,709 INFO L78 Accepts]: Start accepts. Automaton has 2118 states and 3140 transitions. Word has length 25 [2025-03-08 23:14:20,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,709 INFO L471 AbstractCegarLoop]: Abstraction has 2118 states and 3140 transitions. [2025-03-08 23:14:20,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2118 states and 3140 transitions. [2025-03-08 23:14:20,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:20,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,711 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:14:20,712 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1472756360, now seen corresponding path program 1 times [2025-03-08 23:14:20,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-03-08 23:14:20,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:20,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:20,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,732 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:20,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579255191] [2025-03-08 23:14:20,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579255191] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618249618] [2025-03-08 23:14:20,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,733 INFO L87 Difference]: Start difference. First operand 2118 states and 3140 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,754 INFO L93 Difference]: Finished difference Result 3721 states and 5574 transitions. [2025-03-08 23:14:20,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,754 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 23:14:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,763 INFO L225 Difference]: With dead ends: 3721 [2025-03-08 23:14:20,763 INFO L226 Difference]: Without dead ends: 3721 [2025-03-08 23:14:20,763 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:20,763 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 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:20,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 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:20,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2025-03-08 23:14:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3078. [2025-03-08 23:14:20,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 3077 states have (on average 1.4364640883977902) internal successors, (4420), 3077 states have internal predecessors, (4420), 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:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 4420 transitions. [2025-03-08 23:14:20,824 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 4420 transitions. Word has length 25 [2025-03-08 23:14:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,824 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 4420 transitions. [2025-03-08 23:14:20,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 4420 transitions. [2025-03-08 23:14:20,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:20,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,827 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:14:20,827 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1314659127, now seen corresponding path program 1 times [2025-03-08 23:14:20,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785516566] [2025-03-08 23:14:20,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:20,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:20,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,843 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:20,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785516566] [2025-03-08 23:14:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785516566] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784488468] [2025-03-08 23:14:20,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,844 INFO L87 Difference]: Start difference. First operand 3078 states and 4420 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,866 INFO L93 Difference]: Finished difference Result 4105 states and 5830 transitions. [2025-03-08 23:14:20,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2025-03-08 23:14:20,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,876 INFO L225 Difference]: With dead ends: 4105 [2025-03-08 23:14:20,877 INFO L226 Difference]: Without dead ends: 4105 [2025-03-08 23:14:20,877 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:20,878 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 165 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:20,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 165 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:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4105 states. [2025-03-08 23:14:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4105 to 4102. [2025-03-08 23:14:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 1.4211168007802975) internal successors, (5828), 4101 states have internal predecessors, (5828), 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:20,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 5828 transitions. [2025-03-08 23:14:20,933 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 5828 transitions. Word has length 25 [2025-03-08 23:14:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:20,934 INFO L471 AbstractCegarLoop]: Abstraction has 4102 states and 5828 transitions. [2025-03-08 23:14:20,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 5828 transitions. [2025-03-08 23:14:20,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:14:20,937 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:20,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:20,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 23:14:20,937 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:20,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:20,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1588363717, now seen corresponding path program 1 times [2025-03-08 23:14:20,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:20,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297840382] [2025-03-08 23:14:20,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:20,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:14:20,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:14:20,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:20,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:20,952 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:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297840382] [2025-03-08 23:14:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297840382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351755874] [2025-03-08 23:14:20,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:20,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:20,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:20,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:20,953 INFO L87 Difference]: Start difference. First operand 4102 states and 5828 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:20,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:20,974 INFO L93 Difference]: Finished difference Result 4169 states and 5830 transitions. [2025-03-08 23:14:20,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:20,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 23:14:20,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:20,984 INFO L225 Difference]: With dead ends: 4169 [2025-03-08 23:14:20,984 INFO L226 Difference]: Without dead ends: 4169 [2025-03-08 23:14:20,984 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:20,985 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 155 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:20,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 155 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:20,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4169 states. [2025-03-08 23:14:21,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4169 to 4166. [2025-03-08 23:14:21,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4166 states, 4165 states have (on average 1.399279711884754) internal successors, (5828), 4165 states have internal predecessors, (5828), 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:21,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4166 states to 4166 states and 5828 transitions. [2025-03-08 23:14:21,059 INFO L78 Accepts]: Start accepts. Automaton has 4166 states and 5828 transitions. Word has length 26 [2025-03-08 23:14:21,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:21,059 INFO L471 AbstractCegarLoop]: Abstraction has 4166 states and 5828 transitions. [2025-03-08 23:14:21,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:21,059 INFO L276 IsEmpty]: Start isEmpty. Operand 4166 states and 5828 transitions. [2025-03-08 23:14:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:14:21,063 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:21,063 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:21,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 23:14:21,063 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:21,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:21,064 INFO L85 PathProgramCache]: Analyzing trace with hash -2098897894, now seen corresponding path program 1 times [2025-03-08 23:14:21,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:21,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86058931] [2025-03-08 23:14:21,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:21,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:21,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:14:21,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:14:21,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:21,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:21,085 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:21,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:21,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86058931] [2025-03-08 23:14:21,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86058931] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:21,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:21,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:21,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148298383] [2025-03-08 23:14:21,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:21,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:21,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:21,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:21,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:21,086 INFO L87 Difference]: Start difference. First operand 4166 states and 5828 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:21,124 INFO L93 Difference]: Finished difference Result 7177 states and 10118 transitions. [2025-03-08 23:14:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:21,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 23:14:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:21,141 INFO L225 Difference]: With dead ends: 7177 [2025-03-08 23:14:21,141 INFO L226 Difference]: Without dead ends: 7177 [2025-03-08 23:14:21,142 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:21,142 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 128 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:21,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 128 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:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7177 states. [2025-03-08 23:14:21,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7177 to 6150. [2025-03-08 23:14:21,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6150 states, 6149 states have (on average 1.35371605139047) internal successors, (8324), 6149 states have internal predecessors, (8324), 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:21,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6150 states to 6150 states and 8324 transitions. [2025-03-08 23:14:21,281 INFO L78 Accepts]: Start accepts. Automaton has 6150 states and 8324 transitions. Word has length 26 [2025-03-08 23:14:21,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:21,281 INFO L471 AbstractCegarLoop]: Abstraction has 6150 states and 8324 transitions. [2025-03-08 23:14:21,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:21,282 INFO L276 IsEmpty]: Start isEmpty. Operand 6150 states and 8324 transitions. [2025-03-08 23:14:21,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 23:14:21,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:21,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:21,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 23:14:21,289 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:21,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:21,289 INFO L85 PathProgramCache]: Analyzing trace with hash -591346085, now seen corresponding path program 1 times [2025-03-08 23:14:21,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:21,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-03-08 23:14:21,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:21,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:21,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 23:14:21,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 23:14:21,296 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:21,296 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:21,312 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:21,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:21,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831327369] [2025-03-08 23:14:21,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831327369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:21,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:21,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:21,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4485315] [2025-03-08 23:14:21,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:21,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:21,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:21,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:21,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:21,313 INFO L87 Difference]: Start difference. First operand 6150 states and 8324 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:21,358 INFO L93 Difference]: Finished difference Result 8073 states and 10758 transitions. [2025-03-08 23:14:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-08 23:14:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:21,373 INFO L225 Difference]: With dead ends: 8073 [2025-03-08 23:14:21,373 INFO L226 Difference]: Without dead ends: 8073 [2025-03-08 23:14:21,373 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:21,374 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 166 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:21,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 166 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:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8073 states. [2025-03-08 23:14:21,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8073 to 8070. [2025-03-08 23:14:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8070 states, 8069 states have (on average 1.3330028504151692) internal successors, (10756), 8069 states have internal predecessors, (10756), 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:21,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8070 states to 8070 states and 10756 transitions. [2025-03-08 23:14:21,511 INFO L78 Accepts]: Start accepts. Automaton has 8070 states and 10756 transitions. Word has length 26 [2025-03-08 23:14:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:21,511 INFO L471 AbstractCegarLoop]: Abstraction has 8070 states and 10756 transitions. [2025-03-08 23:14:21,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 8070 states and 10756 transitions. [2025-03-08 23:14:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:14:21,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:21,535 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:21,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 23:14:21,535 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:21,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:21,536 INFO L85 PathProgramCache]: Analyzing trace with hash -640502622, now seen corresponding path program 1 times [2025-03-08 23:14:21,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:21,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400860130] [2025-03-08 23:14:21,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:21,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:21,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:14:21,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:14:21,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:21,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:21,555 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:21,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:21,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400860130] [2025-03-08 23:14:21,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400860130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:21,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:21,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:21,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286542844] [2025-03-08 23:14:21,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:21,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:21,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:21,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:21,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:21,556 INFO L87 Difference]: Start difference. First operand 8070 states and 10756 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:21,580 INFO L93 Difference]: Finished difference Result 8201 states and 10758 transitions. [2025-03-08 23:14:21,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:21,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-03-08 23:14:21,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:21,592 INFO L225 Difference]: With dead ends: 8201 [2025-03-08 23:14:21,592 INFO L226 Difference]: Without dead ends: 8201 [2025-03-08 23:14:21,592 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:21,593 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 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:21,593 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 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:21,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8201 states. [2025-03-08 23:14:21,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8201 to 8198. [2025-03-08 23:14:21,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8198 states, 8197 states have (on average 1.3121873856288886) internal successors, (10756), 8197 states have internal predecessors, (10756), 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:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8198 states to 8198 states and 10756 transitions. [2025-03-08 23:14:21,677 INFO L78 Accepts]: Start accepts. Automaton has 8198 states and 10756 transitions. Word has length 27 [2025-03-08 23:14:21,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:21,678 INFO L471 AbstractCegarLoop]: Abstraction has 8198 states and 10756 transitions. [2025-03-08 23:14:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 8198 states and 10756 transitions. [2025-03-08 23:14:21,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:14:21,683 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:21,683 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:21,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 23:14:21,684 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1151036799, now seen corresponding path program 1 times [2025-03-08 23:14:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-03-08 23:14:21,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:21,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:14:21,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:14:21,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:21,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:21,698 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:21,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:21,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61501919] [2025-03-08 23:14:21,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61501919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:21,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:21,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:21,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730622643] [2025-03-08 23:14:21,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:21,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:21,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:21,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:21,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:21,700 INFO L87 Difference]: Start difference. First operand 8198 states and 10756 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:21,727 INFO L93 Difference]: Finished difference Result 13833 states and 18182 transitions. [2025-03-08 23:14:21,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:21,727 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-03-08 23:14:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:21,747 INFO L225 Difference]: With dead ends: 13833 [2025-03-08 23:14:21,747 INFO L226 Difference]: Without dead ends: 13833 [2025-03-08 23:14:21,747 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:21,748 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 30 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 126 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:21,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 126 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:21,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13833 states. [2025-03-08 23:14:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13833 to 12294. [2025-03-08 23:14:21,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12294 states, 12293 states have (on average 1.2706418286829904) internal successors, (15620), 12293 states have internal predecessors, (15620), 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:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12294 states to 12294 states and 15620 transitions. [2025-03-08 23:14:21,893 INFO L78 Accepts]: Start accepts. Automaton has 12294 states and 15620 transitions. Word has length 27 [2025-03-08 23:14:21,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:21,893 INFO L471 AbstractCegarLoop]: Abstraction has 12294 states and 15620 transitions. [2025-03-08 23:14:21,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 12294 states and 15620 transitions. [2025-03-08 23:14:21,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 23:14:21,904 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:21,904 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:21,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 23:14:21,904 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 356515010, now seen corresponding path program 1 times [2025-03-08 23:14:21,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:21,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-03-08 23:14:21,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:21,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:21,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 23:14:21,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 23:14:21,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:21,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:21,925 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:21,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:21,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820111603] [2025-03-08 23:14:21,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820111603] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:21,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361304329] [2025-03-08 23:14:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:21,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:21,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:21,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:21,926 INFO L87 Difference]: Start difference. First operand 12294 states and 15620 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:21,955 INFO L93 Difference]: Finished difference Result 15881 states and 19718 transitions. [2025-03-08 23:14:21,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:21,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2025-03-08 23:14:21,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:21,976 INFO L225 Difference]: With dead ends: 15881 [2025-03-08 23:14:21,976 INFO L226 Difference]: Without dead ends: 15881 [2025-03-08 23:14:21,977 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:21,978 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 167 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:21,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 167 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:21,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15881 states. [2025-03-08 23:14:22,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15881 to 15878. [2025-03-08 23:14:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15878 states, 15877 states have (on average 1.2417963091264093) internal successors, (19716), 15877 states have internal predecessors, (19716), 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:22,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15878 states to 15878 states and 19716 transitions. [2025-03-08 23:14:22,194 INFO L78 Accepts]: Start accepts. Automaton has 15878 states and 19716 transitions. Word has length 27 [2025-03-08 23:14:22,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:22,194 INFO L471 AbstractCegarLoop]: Abstraction has 15878 states and 19716 transitions. [2025-03-08 23:14:22,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 15878 states and 19716 transitions. [2025-03-08 23:14:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:14:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:22,205 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:22,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:14:22,205 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1321586476, now seen corresponding path program 1 times [2025-03-08 23:14:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-03-08 23:14:22,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:22,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:22,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:14:22,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:14:22,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:22,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:22,224 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:22,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:22,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473497354] [2025-03-08 23:14:22,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473497354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:22,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:22,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911383377] [2025-03-08 23:14:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:22,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:22,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:22,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:22,225 INFO L87 Difference]: Start difference. First operand 15878 states and 19716 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:22,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:22,254 INFO L93 Difference]: Finished difference Result 16137 states and 19718 transitions. [2025-03-08 23:14:22,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:22,255 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-03-08 23:14:22,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:22,277 INFO L225 Difference]: With dead ends: 16137 [2025-03-08 23:14:22,277 INFO L226 Difference]: Without dead ends: 16137 [2025-03-08 23:14:22,278 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:22,278 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 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:22,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 147 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:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16137 states. [2025-03-08 23:14:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16137 to 16134. [2025-03-08 23:14:22,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16134 states, 16133 states have (on average 1.222091365524081) internal successors, (19716), 16133 states have internal predecessors, (19716), 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:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16134 states to 16134 states and 19716 transitions. [2025-03-08 23:14:22,465 INFO L78 Accepts]: Start accepts. Automaton has 16134 states and 19716 transitions. Word has length 28 [2025-03-08 23:14:22,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:22,465 INFO L471 AbstractCegarLoop]: Abstraction has 16134 states and 19716 transitions. [2025-03-08 23:14:22,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:22,466 INFO L276 IsEmpty]: Start isEmpty. Operand 16134 states and 19716 transitions. [2025-03-08 23:14:22,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:14:22,480 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:22,480 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:22,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 23:14:22,481 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:22,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:22,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1832120653, now seen corresponding path program 1 times [2025-03-08 23:14:22,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:22,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-03-08 23:14:22,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:22,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:22,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:14:22,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:14:22,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:22,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:22,509 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:22,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:22,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408213174] [2025-03-08 23:14:22,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408213174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:22,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:22,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:22,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303818340] [2025-03-08 23:14:22,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:22,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:22,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:22,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:22,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:22,510 INFO L87 Difference]: Start difference. First operand 16134 states and 19716 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:22,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:22,569 INFO L93 Difference]: Finished difference Result 26633 states and 32262 transitions. [2025-03-08 23:14:22,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:22,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-03-08 23:14:22,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:22,613 INFO L225 Difference]: With dead ends: 26633 [2025-03-08 23:14:22,613 INFO L226 Difference]: Without dead ends: 26633 [2025-03-08 23:14:22,613 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:22,614 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 27 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 124 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:22,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 124 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:22,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26633 states. [2025-03-08 23:14:22,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26633 to 24582. [2025-03-08 23:14:22,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24582 states, 24581 states have (on average 1.187421178959359) internal successors, (29188), 24581 states have internal predecessors, (29188), 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:22,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24582 states to 24582 states and 29188 transitions. [2025-03-08 23:14:22,941 INFO L78 Accepts]: Start accepts. Automaton has 24582 states and 29188 transitions. Word has length 28 [2025-03-08 23:14:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:22,941 INFO L471 AbstractCegarLoop]: Abstraction has 24582 states and 29188 transitions. [2025-03-08 23:14:22,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:22,941 INFO L276 IsEmpty]: Start isEmpty. Operand 24582 states and 29188 transitions. [2025-03-08 23:14:22,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 23:14:22,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:22,961 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:22,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 23:14:22,961 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:22,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:22,962 INFO L85 PathProgramCache]: Analyzing trace with hash -324568844, now seen corresponding path program 1 times [2025-03-08 23:14:22,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:22,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4296161] [2025-03-08 23:14:22,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:22,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:22,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-08 23:14:22,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 23:14:22,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:22,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:22,981 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:22,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:22,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4296161] [2025-03-08 23:14:22,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4296161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:22,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:22,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:22,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492734394] [2025-03-08 23:14:22,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:22,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:22,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:22,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:22,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:22,982 INFO L87 Difference]: Start difference. First operand 24582 states and 29188 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:23,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:23,046 INFO L93 Difference]: Finished difference Result 31241 states and 35846 transitions. [2025-03-08 23:14:23,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:23,047 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2025-03-08 23:14:23,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:23,186 INFO L225 Difference]: With dead ends: 31241 [2025-03-08 23:14:23,186 INFO L226 Difference]: Without dead ends: 31241 [2025-03-08 23:14:23,186 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:23,186 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 168 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:23,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 168 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:23,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31241 states. [2025-03-08 23:14:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31241 to 31238. [2025-03-08 23:14:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31238 states, 31237 states have (on average 1.1474853539072254) internal successors, (35844), 31237 states have internal predecessors, (35844), 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:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31238 states to 31238 states and 35844 transitions. [2025-03-08 23:14:23,424 INFO L78 Accepts]: Start accepts. Automaton has 31238 states and 35844 transitions. Word has length 28 [2025-03-08 23:14:23,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:23,424 INFO L471 AbstractCegarLoop]: Abstraction has 31238 states and 35844 transitions. [2025-03-08 23:14:23,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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:23,424 INFO L276 IsEmpty]: Start isEmpty. Operand 31238 states and 35844 transitions. [2025-03-08 23:14:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:14:23,437 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:23,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:23,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 23:14:23,437 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:23,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:23,438 INFO L85 PathProgramCache]: Analyzing trace with hash -960356197, now seen corresponding path program 1 times [2025-03-08 23:14:23,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:23,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-03-08 23:14:23,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:23,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:23,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:14:23,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:14:23,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:23,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:23,462 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:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847511481] [2025-03-08 23:14:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847511481] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:23,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243604742] [2025-03-08 23:14:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:23,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:23,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:23,463 INFO L87 Difference]: Start difference. First operand 31238 states and 35844 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:23,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:23,520 INFO L93 Difference]: Finished difference Result 31753 states and 35846 transitions. [2025-03-08 23:14:23,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:23,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-03-08 23:14:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:23,562 INFO L225 Difference]: With dead ends: 31753 [2025-03-08 23:14:23,563 INFO L226 Difference]: Without dead ends: 31753 [2025-03-08 23:14:23,564 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:23,564 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 143 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:23,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 143 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:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31753 states. [2025-03-08 23:14:23,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31753 to 31750. [2025-03-08 23:14:23,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31750 states, 31749 states have (on average 1.1289804403288293) internal successors, (35844), 31749 states have internal predecessors, (35844), 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:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31750 states to 31750 states and 35844 transitions. [2025-03-08 23:14:23,891 INFO L78 Accepts]: Start accepts. Automaton has 31750 states and 35844 transitions. Word has length 29 [2025-03-08 23:14:23,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:23,892 INFO L471 AbstractCegarLoop]: Abstraction has 31750 states and 35844 transitions. [2025-03-08 23:14:23,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:23,892 INFO L276 IsEmpty]: Start isEmpty. Operand 31750 states and 35844 transitions. [2025-03-08 23:14:23,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:14:23,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:23,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:23,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 23:14:23,905 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:23,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:23,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1470890374, now seen corresponding path program 1 times [2025-03-08 23:14:23,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:23,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190788991] [2025-03-08 23:14:23,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:23,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:23,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:14:23,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:14:23,910 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:23,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:23,924 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:23,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:23,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190788991] [2025-03-08 23:14:23,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190788991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:23,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:23,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:23,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980958763] [2025-03-08 23:14:23,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:23,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:23,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:23,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:23,925 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:23,925 INFO L87 Difference]: Start difference. First operand 31750 states and 35844 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:24,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:24,062 INFO L93 Difference]: Finished difference Result 51206 states and 56324 transitions. [2025-03-08 23:14:24,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:24,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-03-08 23:14:24,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:24,130 INFO L225 Difference]: With dead ends: 51206 [2025-03-08 23:14:24,131 INFO L226 Difference]: Without dead ends: 51206 [2025-03-08 23:14:24,131 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:24,131 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 22 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 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:24,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 120 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:24,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51206 states. [2025-03-08 23:14:24,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51206 to 49158. [2025-03-08 23:14:24,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49158 states, 49157 states have (on average 1.1041357283804951) internal successors, (54276), 49157 states have internal predecessors, (54276), 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:24,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49158 states to 49158 states and 54276 transitions. [2025-03-08 23:14:24,627 INFO L78 Accepts]: Start accepts. Automaton has 49158 states and 54276 transitions. Word has length 29 [2025-03-08 23:14:24,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:24,627 INFO L471 AbstractCegarLoop]: Abstraction has 49158 states and 54276 transitions. [2025-03-08 23:14:24,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 49158 states and 54276 transitions. [2025-03-08 23:14:24,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 23:14:24,660 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:24,660 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:24,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 23:14:24,661 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:24,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:24,661 INFO L85 PathProgramCache]: Analyzing trace with hash 36661435, now seen corresponding path program 1 times [2025-03-08 23:14:24,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:24,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-03-08 23:14:24,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:24,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 23:14:24,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 23:14:24,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:24,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:24,677 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:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:24,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672050447] [2025-03-08 23:14:24,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672050447] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:24,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:24,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:24,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057101998] [2025-03-08 23:14:24,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:24,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:24,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:24,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:24,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:24,678 INFO L87 Difference]: Start difference. First operand 49158 states and 54276 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:24,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:24,807 INFO L93 Difference]: Finished difference Result 61443 states and 64514 transitions. [2025-03-08 23:14:24,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2025-03-08 23:14:24,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:24,807 INFO L225 Difference]: With dead ends: 61443 [2025-03-08 23:14:24,807 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 23:14:24,807 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:24,808 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 165 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:24,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 165 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:24,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 23:14:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 23:14:24,808 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:24,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 23:14:24,808 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2025-03-08 23:14:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 23:14:24,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 23:14:24,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 23:14:24,811 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-08 23:14:24,812 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-08 23:14:24,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 23:14:24,815 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:24,817 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:14:24,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:14:24 BoogieIcfgContainer [2025-03-08 23:14:24,819 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:14:24,820 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:14:24,820 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:14:24,820 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:14:24,821 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:19" (3/4) ... [2025-03-08 23:14:24,823 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 23:14:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 23:14:24,831 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 23:14:24,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 23:14:24,832 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:14:24,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 23:14:24,899 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 23:14:24,900 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:14:24,900 INFO L158 Benchmark]: Toolchain (without parser) took 6352.83ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.7MB in the beginning and 849.3MB in the end (delta: -741.5MB). Peak memory consumption was 571.3MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,900 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:24,900 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.97ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,900 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.86ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:24,900 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,901 INFO L158 Benchmark]: IcfgBuilder took 273.53ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 77.4MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,901 INFO L158 Benchmark]: TraceAbstraction took 5754.29ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.8MB in the beginning and 856.7MB in the end (delta: -780.0MB). Peak memory consumption was 529.3MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,901 INFO L158 Benchmark]: Witness Printer took 79.31ms. Allocated memory is still 1.5GB. Free memory was 856.7MB in the beginning and 849.3MB in the end (delta: 7.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:24,901 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.23ms. Allocated memory is still 201.3MB. Free memory is still 116.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 183.97ms. Allocated memory is still 142.6MB. Free memory was 107.7MB in the beginning and 95.9MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.86ms. Allocated memory is still 142.6MB. Free memory was 95.9MB in the beginning and 94.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 142.6MB. Free memory was 94.6MB in the beginning and 93.5MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 273.53ms. Allocated memory is still 142.6MB. Free memory was 93.5MB in the beginning and 77.4MB in the end (delta: 16.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 5754.29ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 76.8MB in the beginning and 856.7MB in the end (delta: -780.0MB). Peak memory consumption was 529.3MB. Max. memory is 16.1GB. * Witness Printer took 79.31ms. Allocated memory is still 1.5GB. Free memory was 856.7MB in the beginning and 849.3MB in the end (delta: 7.4MB). 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, 46 locations, 80 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 34, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1548 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1548 mSDsluCounter, 5011 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1956 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 172 IncrementalHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 3055 mSDtfsCounter, 172 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49158occurred in iteration=33, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 34 MinimizatonAttempts, 8256 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 784 NumberOfCodeBlocks, 784 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 1594 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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:24,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE