./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 23:14:40,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 23:14:40,182 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:40,185 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 23:14:40,186 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 23:14:40,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 23:14:40,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 23:14:40,207 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 23:14:40,208 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 23:14:40,208 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 23:14:40,208 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 23:14:40,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 23:14:40,208 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 23:14:40,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 23:14:40,210 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:40,210 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 23:14:40,210 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 23:14:40,211 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 23:14:40,211 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 23:14:40,211 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 23:14:40,211 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 23:14:40,211 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2025-03-08 23:14:40,420 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 23:14:40,425 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 23:14:40,427 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 23:14:40,428 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 23:14:40,428 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 23:14:40,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2025-03-08 23:14:41,625 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d06bd4b/b53fa15579aa466abaa3416b0e87c5fc/FLAG76415663a [2025-03-08 23:14:41,860 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 23:14:41,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2025-03-08 23:14:41,877 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d06bd4b/b53fa15579aa466abaa3416b0e87c5fc/FLAG76415663a [2025-03-08 23:14:42,199 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79d06bd4b/b53fa15579aa466abaa3416b0e87c5fc [2025-03-08 23:14:42,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 23:14:42,202 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 23:14:42,203 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:42,203 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 23:14:42,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 23:14:42,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:42" (1/1) ... [2025-03-08 23:14:42,207 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0a1a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42, skipping insertion in model container [2025-03-08 23:14:42,207 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 11:14:42" (1/1) ... [2025-03-08 23:14:42,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 23:14:42,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:42,343 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 23:14:42,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 23:14:42,375 INFO L204 MainTranslator]: Completed translation [2025-03-08 23:14:42,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42 WrapperNode [2025-03-08 23:14:42,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 23:14:42,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:42,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 23:14:42,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 23:14:42,380 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:42" (1/1) ... [2025-03-08 23:14:42,388 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:42" (1/1) ... [2025-03-08 23:14:42,402 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 134 [2025-03-08 23:14:42,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 23:14:42,403 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 23:14:42,403 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 23:14:42,403 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 23:14:42,408 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:42" (1/1) ... [2025-03-08 23:14:42,408 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:42" (1/1) ... [2025-03-08 23:14:42,411 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:42" (1/1) ... [2025-03-08 23:14:42,425 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:42,427 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:42" (1/1) ... [2025-03-08 23:14:42,427 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:42" (1/1) ... [2025-03-08 23:14:42,432 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:42" (1/1) ... [2025-03-08 23:14:42,433 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:42" (1/1) ... [2025-03-08 23:14:42,434 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:42" (1/1) ... [2025-03-08 23:14:42,434 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:42" (1/1) ... [2025-03-08 23:14:42,435 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 23:14:42,435 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 23:14:42,436 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 23:14:42,436 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 23:14:42,436 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (1/1) ... [2025-03-08 23:14:42,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 23:14:42,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 23:14:42,468 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:42,469 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:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 23:14:42,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 23:14:42,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 23:14:42,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 23:14:42,525 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 23:14:42,527 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 23:14:42,678 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-03-08 23:14:42,678 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 23:14:42,688 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 23:14:42,689 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 23:14:42,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:42 BoogieIcfgContainer [2025-03-08 23:14:42,689 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 23:14:42,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 23:14:42,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 23:14:42,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 23:14:42,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 11:14:42" (1/3) ... [2025-03-08 23:14:42,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e4d4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:42, skipping insertion in model container [2025-03-08 23:14:42,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 11:14:42" (2/3) ... [2025-03-08 23:14:42,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57e4d4c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 11:14:42, skipping insertion in model container [2025-03-08 23:14:42,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 11:14:42" (3/3) ... [2025-03-08 23:14:42,698 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2025-03-08 23:14:42,710 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 23:14:42,711 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_9.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-08 23:14:42,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 23:14:42,748 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;@54be5b0a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 23:14:42,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 23:14:42,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:42,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-08 23:14:42,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:42,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-08 23:14:42,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:42,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:42,760 INFO L85 PathProgramCache]: Analyzing trace with hash 122116441, now seen corresponding path program 1 times [2025-03-08 23:14:42,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:42,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467496127] [2025-03-08 23:14:42,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:42,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-08 23:14:42,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-08 23:14:42,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:42,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:42,864 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:42,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:42,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467496127] [2025-03-08 23:14:42,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467496127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:42,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:42,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:42,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271051500] [2025-03-08 23:14:42,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:42,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 23:14:42,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:42,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 23:14:42,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 23:14:42,892 INFO L87 Difference]: Start difference. First operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:42,902 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2025-03-08 23:14:42,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 23:14:42,904 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:42,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:42,908 INFO L225 Difference]: With dead ends: 39 [2025-03-08 23:14:42,909 INFO L226 Difference]: Without dead ends: 37 [2025-03-08 23:14:42,910 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:42,914 INFO L435 NwaCegarLoop]: 65 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, 65 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:42,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 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:42,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-08 23:14:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-08 23:14:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:42,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2025-03-08 23:14:42,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 5 [2025-03-08 23:14:42,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:42,948 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2025-03-08 23:14:42,948 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:42,948 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2025-03-08 23:14:42,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-08 23:14:42,949 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:42,949 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-08 23:14:42,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 23:14:42,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:42,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:42,950 INFO L85 PathProgramCache]: Analyzing trace with hash -509306474, now seen corresponding path program 1 times [2025-03-08 23:14:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-08 23:14:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:42,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-08 23:14:42,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-08 23:14:42,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:42,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,024 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:43,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992881199] [2025-03-08 23:14:43,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992881199] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 23:14:43,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503496176] [2025-03-08 23:14:43,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,026 INFO L87 Difference]: Start difference. First operand 37 states and 63 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:43,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,034 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2025-03-08 23:14:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,034 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:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,036 INFO L225 Difference]: With dead ends: 36 [2025-03-08 23:14:43,036 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 23:14:43,036 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:43,038 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 62 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:43,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 62 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:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 23:14:43,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-03-08 23:14:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 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:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2025-03-08 23:14:43,043 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 6 [2025-03-08 23:14:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,043 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2025-03-08 23:14:43,043 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:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2025-03-08 23:14:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:14:43,044 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,044 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:43,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 23:14:43,045 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1169756173, now seen corresponding path program 1 times [2025-03-08 23:14:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-03-08 23:14:43,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:14:43,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:14:43,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,115 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:43,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419699316] [2025-03-08 23:14:43,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419699316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616198485] [2025-03-08 23:14:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,116 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,139 INFO L93 Difference]: Finished difference Result 65 states and 115 transitions. [2025-03-08 23:14:43,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,140 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 23:14:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,141 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:14:43,141 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 23:14:43,141 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:43,141 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 118 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:43,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 118 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:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 23:14:43,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2025-03-08 23:14:43,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2025-03-08 23:14:43,152 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 17 [2025-03-08 23:14:43,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,152 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2025-03-08 23:14:43,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,153 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2025-03-08 23:14:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-08 23:14:43,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,153 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:43,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 23:14:43,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,155 INFO L85 PathProgramCache]: Analyzing trace with hash 876353166, now seen corresponding path program 1 times [2025-03-08 23:14:43,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951991835] [2025-03-08 23:14:43,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-08 23:14:43,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-08 23:14:43,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,225 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:43,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951991835] [2025-03-08 23:14:43,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951991835] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594459622] [2025-03-08 23:14:43,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,226 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,243 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2025-03-08 23:14:43,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-08 23:14:43,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,244 INFO L225 Difference]: With dead ends: 65 [2025-03-08 23:14:43,244 INFO L226 Difference]: Without dead ends: 65 [2025-03-08 23:14:43,244 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:43,244 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 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:43,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 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:43,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-08 23:14:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-03-08 23:14:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 0 states have call successors, (0), 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:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 111 transitions. [2025-03-08 23:14:43,250 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 111 transitions. Word has length 17 [2025-03-08 23:14:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,250 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 111 transitions. [2025-03-08 23:14:43,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,250 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 111 transitions. [2025-03-08 23:14:43,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:43,251 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,251 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:43,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 23:14:43,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1903559282, now seen corresponding path program 1 times [2025-03-08 23:14:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555960229] [2025-03-08 23:14:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:43,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:43,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,294 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:43,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555960229] [2025-03-08 23:14:43,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555960229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776647786] [2025-03-08 23:14:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,295 INFO L87 Difference]: Start difference. First operand 62 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,315 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2025-03-08 23:14:43,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 23:14:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,316 INFO L225 Difference]: With dead ends: 68 [2025-03-08 23:14:43,316 INFO L226 Difference]: Without dead ends: 68 [2025-03-08 23:14:43,317 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:43,317 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 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:43,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 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:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-08 23:14:43,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-03-08 23:14:43,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 0 states have call successors, (0), 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:43,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 113 transitions. [2025-03-08 23:14:43,325 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 113 transitions. Word has length 18 [2025-03-08 23:14:43,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,325 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 113 transitions. [2025-03-08 23:14:43,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 113 transitions. [2025-03-08 23:14:43,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:43,325 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,325 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:43,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 23:14:43,326 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1398000657, now seen corresponding path program 1 times [2025-03-08 23:14:43,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-08 23:14:43,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:43,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:43,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,365 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:43,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930090440] [2025-03-08 23:14:43,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930090440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206378123] [2025-03-08 23:14:43,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,368 INFO L87 Difference]: Start difference. First operand 65 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,398 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2025-03-08 23:14:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 23:14:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,401 INFO L225 Difference]: With dead ends: 121 [2025-03-08 23:14:43,401 INFO L226 Difference]: Without dead ends: 121 [2025-03-08 23:14:43,401 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:43,401 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 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:43,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 116 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:43,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-08 23:14:43,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2025-03-08 23:14:43,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 0 states have call successors, (0), 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:43,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 150 transitions. [2025-03-08 23:14:43,406 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 150 transitions. Word has length 18 [2025-03-08 23:14:43,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,407 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 150 transitions. [2025-03-08 23:14:43,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,408 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 150 transitions. [2025-03-08 23:14:43,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-08 23:14:43,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,409 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 23:14:43,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 23:14:43,409 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1104597650, now seen corresponding path program 1 times [2025-03-08 23:14:43,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-08 23:14:43,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-08 23:14:43,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-08 23:14:43,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,440 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:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-08 23:14:43,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553412419] [2025-03-08 23:14:43,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,443 INFO L87 Difference]: Start difference. First operand 86 states and 150 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,461 INFO L93 Difference]: Finished difference Result 123 states and 210 transitions. [2025-03-08 23:14:43,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-08 23:14:43,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,462 INFO L225 Difference]: With dead ends: 123 [2025-03-08 23:14:43,462 INFO L226 Difference]: Without dead ends: 123 [2025-03-08 23:14:43,462 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:43,463 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 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:43,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 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:43,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-03-08 23:14:43,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-03-08 23:14:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 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:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 208 transitions. [2025-03-08 23:14:43,470 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 208 transitions. Word has length 18 [2025-03-08 23:14:43,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,470 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 208 transitions. [2025-03-08 23:14:43,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 23:14:43,470 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 208 transitions. [2025-03-08 23:14:43,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:43,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,475 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:43,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 23:14:43,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,475 INFO L85 PathProgramCache]: Analyzing trace with hash 389196967, now seen corresponding path program 1 times [2025-03-08 23:14:43,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-08 23:14:43,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:43,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:43,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,513 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:43,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748495576] [2025-03-08 23:14:43,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748495576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772007673] [2025-03-08 23:14:43,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,515 INFO L87 Difference]: Start difference. First operand 120 states and 208 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:43,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,527 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2025-03-08 23:14:43,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,528 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:43,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,528 INFO L225 Difference]: With dead ends: 125 [2025-03-08 23:14:43,529 INFO L226 Difference]: Without dead ends: 125 [2025-03-08 23:14:43,530 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:43,530 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 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:43,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 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:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-03-08 23:14:43,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-03-08 23:14:43,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 0 states have call successors, (0), 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:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 208 transitions. [2025-03-08 23:14:43,541 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 208 transitions. Word has length 19 [2025-03-08 23:14:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,541 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 208 transitions. [2025-03-08 23:14:43,541 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:43,541 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 208 transitions. [2025-03-08 23:14:43,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:43,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,542 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:43,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 23:14:43,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -116361658, now seen corresponding path program 1 times [2025-03-08 23:14:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863627796] [2025-03-08 23:14:43,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:43,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:43,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,575 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:43,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863627796] [2025-03-08 23:14:43,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863627796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478610960] [2025-03-08 23:14:43,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,578 INFO L87 Difference]: Start difference. First operand 122 states and 208 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:43,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,587 INFO L93 Difference]: Finished difference Result 225 states and 386 transitions. [2025-03-08 23:14:43,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,587 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:43,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,588 INFO L225 Difference]: With dead ends: 225 [2025-03-08 23:14:43,588 INFO L226 Difference]: Without dead ends: 225 [2025-03-08 23:14:43,588 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:43,588 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 38 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 114 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:43,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 114 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:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-03-08 23:14:43,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 166. [2025-03-08 23:14:43,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 0 states have call successors, (0), 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:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 280 transitions. [2025-03-08 23:14:43,594 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 280 transitions. Word has length 19 [2025-03-08 23:14:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,594 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 280 transitions. [2025-03-08 23:14:43,594 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:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 280 transitions. [2025-03-08 23:14:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-08 23:14:43,595 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,595 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:43,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 23:14:43,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -409764665, now seen corresponding path program 1 times [2025-03-08 23:14:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024304565] [2025-03-08 23:14:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-08 23:14:43,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-08 23:14:43,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,619 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:43,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024304565] [2025-03-08 23:14:43,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024304565] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163342993] [2025-03-08 23:14:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,621 INFO L87 Difference]: Start difference. First operand 166 states and 280 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:43,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,631 INFO L93 Difference]: Finished difference Result 233 states and 386 transitions. [2025-03-08 23:14:43,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,631 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:43,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,632 INFO L225 Difference]: With dead ends: 233 [2025-03-08 23:14:43,632 INFO L226 Difference]: Without dead ends: 233 [2025-03-08 23:14:43,632 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:43,633 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 133 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:43,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 133 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:43,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-03-08 23:14:43,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-03-08 23:14:43,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 0 states have call successors, (0), 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:43,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 384 transitions. [2025-03-08 23:14:43,644 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 384 transitions. Word has length 19 [2025-03-08 23:14:43,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,644 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 384 transitions. [2025-03-08 23:14:43,644 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:43,644 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 384 transitions. [2025-03-08 23:14:43,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:43,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,645 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:43,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 23:14:43,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 688598731, now seen corresponding path program 1 times [2025-03-08 23:14:43,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-08 23:14:43,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:43,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:43,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,680 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:43,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619223863] [2025-03-08 23:14:43,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619223863] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849098909] [2025-03-08 23:14:43,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,681 INFO L87 Difference]: Start difference. First operand 230 states and 384 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:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,701 INFO L93 Difference]: Finished difference Result 237 states and 386 transitions. [2025-03-08 23:14:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,702 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:43,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,703 INFO L225 Difference]: With dead ends: 237 [2025-03-08 23:14:43,703 INFO L226 Difference]: Without dead ends: 237 [2025-03-08 23:14:43,703 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:43,704 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 139 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:43,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 139 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:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-03-08 23:14:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-03-08 23:14:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 0 states have call successors, (0), 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:43,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 384 transitions. [2025-03-08 23:14:43,709 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 384 transitions. Word has length 20 [2025-03-08 23:14:43,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,709 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 384 transitions. [2025-03-08 23:14:43,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:43,709 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 384 transitions. [2025-03-08 23:14:43,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:43,710 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,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:43,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 23:14:43,710 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,711 INFO L85 PathProgramCache]: Analyzing trace with hash 183040106, now seen corresponding path program 1 times [2025-03-08 23:14:43,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-03-08 23:14:43,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:43,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:43,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,745 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:43,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505011314] [2025-03-08 23:14:43,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505011314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877938367] [2025-03-08 23:14:43,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,747 INFO L87 Difference]: Start difference. First operand 234 states and 384 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:43,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,759 INFO L93 Difference]: Finished difference Result 425 states and 702 transitions. [2025-03-08 23:14:43,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,760 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:43,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,762 INFO L225 Difference]: With dead ends: 425 [2025-03-08 23:14:43,762 INFO L226 Difference]: Without dead ends: 425 [2025-03-08 23:14:43,762 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:43,763 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 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:43,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 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:43,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-03-08 23:14:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 326. [2025-03-08 23:14:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 0 states have call successors, (0), 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:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 524 transitions. [2025-03-08 23:14:43,772 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 524 transitions. Word has length 20 [2025-03-08 23:14:43,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,772 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 524 transitions. [2025-03-08 23:14:43,772 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:43,772 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 524 transitions. [2025-03-08 23:14:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-08 23:14:43,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,775 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:43,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 23:14:43,775 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash -110362901, now seen corresponding path program 1 times [2025-03-08 23:14:43,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480068948] [2025-03-08 23:14:43,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-08 23:14:43,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-08 23:14:43,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,802 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:43,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480068948] [2025-03-08 23:14:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480068948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218375425] [2025-03-08 23:14:43,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,803 INFO L87 Difference]: Start difference. First operand 326 states and 524 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:43,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,819 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2025-03-08 23:14:43,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,819 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:43,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,820 INFO L225 Difference]: With dead ends: 449 [2025-03-08 23:14:43,821 INFO L226 Difference]: Without dead ends: 449 [2025-03-08 23:14:43,821 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:43,821 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 134 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:43,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 134 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:43,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-03-08 23:14:43,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2025-03-08 23:14:43,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 0 states have call successors, (0), 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:43,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 708 transitions. [2025-03-08 23:14:43,829 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 708 transitions. Word has length 20 [2025-03-08 23:14:43,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,829 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 708 transitions. [2025-03-08 23:14:43,830 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:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 708 transitions. [2025-03-08 23:14:43,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:43,831 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,831 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:43,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 23:14:43,832 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1380112096, now seen corresponding path program 1 times [2025-03-08 23:14:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523609468] [2025-03-08 23:14:43,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:43,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:43,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,857 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:43,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523609468] [2025-03-08 23:14:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523609468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266406791] [2025-03-08 23:14:43,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,858 INFO L87 Difference]: Start difference. First operand 446 states and 708 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:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,869 INFO L93 Difference]: Finished difference Result 457 states and 710 transitions. [2025-03-08 23:14:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,869 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:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,871 INFO L225 Difference]: With dead ends: 457 [2025-03-08 23:14:43,871 INFO L226 Difference]: Without dead ends: 457 [2025-03-08 23:14:43,871 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:43,871 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 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:43,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 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:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-08 23:14:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2025-03-08 23:14:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 0 states have call successors, (0), 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:43,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 708 transitions. [2025-03-08 23:14:43,889 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 708 transitions. Word has length 21 [2025-03-08 23:14:43,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,889 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 708 transitions. [2025-03-08 23:14:43,889 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:43,890 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 708 transitions. [2025-03-08 23:14:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:43,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,890 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:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 23:14:43,891 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash 874553471, now seen corresponding path program 1 times [2025-03-08 23:14:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65423017] [2025-03-08 23:14:43,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:43,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:43,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,943 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:43,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:43,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65423017] [2025-03-08 23:14:43,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65423017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:43,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:43,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:43,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328442107] [2025-03-08 23:14:43,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:43,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:43,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:43,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:43,945 INFO L87 Difference]: Start difference. First operand 454 states and 708 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:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:43,954 INFO L93 Difference]: Finished difference Result 809 states and 1270 transitions. [2025-03-08 23:14:43,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:43,954 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:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:43,957 INFO L225 Difference]: With dead ends: 809 [2025-03-08 23:14:43,957 INFO L226 Difference]: Without dead ends: 809 [2025-03-08 23:14:43,958 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:43,958 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 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:43,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 110 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:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-03-08 23:14:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 646. [2025-03-08 23:14:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.5193798449612403) internal successors, (980), 645 states have internal predecessors, (980), 0 states have call successors, (0), 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:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 980 transitions. [2025-03-08 23:14:43,974 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 980 transitions. Word has length 21 [2025-03-08 23:14:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:43,974 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 980 transitions. [2025-03-08 23:14:43,974 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:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 980 transitions. [2025-03-08 23:14:43,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-08 23:14:43,976 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:43,976 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:43,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 23:14:43,976 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:43,977 INFO L85 PathProgramCache]: Analyzing trace with hash 581150464, now seen corresponding path program 1 times [2025-03-08 23:14:43,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:43,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-08 23:14:43,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:43,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:43,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-08 23:14:43,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-08 23:14:43,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:43,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:43,999 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:44,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072519813] [2025-03-08 23:14:44,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072519813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948829480] [2025-03-08 23:14:44,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,001 INFO L87 Difference]: Start difference. First operand 646 states and 980 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:44,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,015 INFO L93 Difference]: Finished difference Result 873 states and 1302 transitions. [2025-03-08 23:14:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,015 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:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,018 INFO L225 Difference]: With dead ends: 873 [2025-03-08 23:14:44,018 INFO L226 Difference]: Without dead ends: 873 [2025-03-08 23:14:44,018 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:44,019 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 135 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:44,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 135 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:44,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-03-08 23:14:44,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 870. [2025-03-08 23:14:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 0 states have call successors, (0), 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:44,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1300 transitions. [2025-03-08 23:14:44,033 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1300 transitions. Word has length 21 [2025-03-08 23:14:44,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,033 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1300 transitions. [2025-03-08 23:14:44,033 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:44,034 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1300 transitions. [2025-03-08 23:14:44,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:44,036 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,036 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:44,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 23:14:44,036 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1342183204, now seen corresponding path program 1 times [2025-03-08 23:14:44,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273561749] [2025-03-08 23:14:44,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:44,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:44,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,060 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:44,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273561749] [2025-03-08 23:14:44,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273561749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752214614] [2025-03-08 23:14:44,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,062 INFO L87 Difference]: Start difference. First operand 870 states and 1300 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:44,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,073 INFO L93 Difference]: Finished difference Result 889 states and 1302 transitions. [2025-03-08 23:14:44,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,074 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:44,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,077 INFO L225 Difference]: With dead ends: 889 [2025-03-08 23:14:44,077 INFO L226 Difference]: Without dead ends: 889 [2025-03-08 23:14:44,077 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:44,077 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 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:44,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 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:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-03-08 23:14:44,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 886. [2025-03-08 23:14:44,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 1.4689265536723164) internal successors, (1300), 885 states have internal predecessors, (1300), 0 states have call successors, (0), 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:44,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1300 transitions. [2025-03-08 23:14:44,091 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1300 transitions. Word has length 22 [2025-03-08 23:14:44,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,091 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1300 transitions. [2025-03-08 23:14:44,091 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:44,091 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1300 transitions. [2025-03-08 23:14:44,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:44,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,092 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:44,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 23:14:44,093 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,093 INFO L85 PathProgramCache]: Analyzing trace with hash 836624579, now seen corresponding path program 1 times [2025-03-08 23:14:44,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-03-08 23:14:44,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:44,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:44,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,111 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:44,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258058880] [2025-03-08 23:14:44,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258058880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951313703] [2025-03-08 23:14:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,113 INFO L87 Difference]: Start difference. First operand 886 states and 1300 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:44,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,125 INFO L93 Difference]: Finished difference Result 1545 states and 2278 transitions. [2025-03-08 23:14:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,126 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:44,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,130 INFO L225 Difference]: With dead ends: 1545 [2025-03-08 23:14:44,130 INFO L226 Difference]: Without dead ends: 1545 [2025-03-08 23:14:44,130 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:44,130 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 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:44,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 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:44,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-03-08 23:14:44,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1286. [2025-03-08 23:14:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.422568093385214) internal successors, (1828), 1285 states have internal predecessors, (1828), 0 states have call successors, (0), 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:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1828 transitions. [2025-03-08 23:14:44,151 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1828 transitions. Word has length 22 [2025-03-08 23:14:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,151 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1828 transitions. [2025-03-08 23:14:44,151 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:44,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1828 transitions. [2025-03-08 23:14:44,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-08 23:14:44,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,154 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:44,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 23:14:44,154 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,154 INFO L85 PathProgramCache]: Analyzing trace with hash 543221572, now seen corresponding path program 1 times [2025-03-08 23:14:44,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909732524] [2025-03-08 23:14:44,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-08 23:14:44,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-08 23:14:44,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,174 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:44,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909732524] [2025-03-08 23:14:44,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909732524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946978566] [2025-03-08 23:14:44,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,177 INFO L87 Difference]: Start difference. First operand 1286 states and 1828 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:44,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,192 INFO L93 Difference]: Finished difference Result 1705 states and 2374 transitions. [2025-03-08 23:14:44,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,192 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:44,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,197 INFO L225 Difference]: With dead ends: 1705 [2025-03-08 23:14:44,197 INFO L226 Difference]: Without dead ends: 1705 [2025-03-08 23:14:44,197 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:44,198 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 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:44,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 136 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:44,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-03-08 23:14:44,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1702. [2025-03-08 23:14:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.3944738389182834) internal successors, (2372), 1701 states have internal predecessors, (2372), 0 states have call successors, (0), 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:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2372 transitions. [2025-03-08 23:14:44,234 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2372 transitions. Word has length 22 [2025-03-08 23:14:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,234 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2372 transitions. [2025-03-08 23:14:44,234 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:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2372 transitions. [2025-03-08 23:14:44,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:44,236 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,236 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:44,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 23:14:44,237 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,238 INFO L85 PathProgramCache]: Analyzing trace with hash 166380825, now seen corresponding path program 1 times [2025-03-08 23:14:44,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-08 23:14:44,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,262 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:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-08 23:14:44,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464680206] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259035135] [2025-03-08 23:14:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,264 INFO L87 Difference]: Start difference. First operand 1702 states and 2372 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:44,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,280 INFO L93 Difference]: Finished difference Result 1737 states and 2374 transitions. [2025-03-08 23:14:44,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,280 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:44,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,284 INFO L225 Difference]: With dead ends: 1737 [2025-03-08 23:14:44,284 INFO L226 Difference]: Without dead ends: 1737 [2025-03-08 23:14:44,284 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:44,285 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 127 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:44,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 127 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:44,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-03-08 23:14:44,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1734. [2025-03-08 23:14:44,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.3687247547605308) internal successors, (2372), 1733 states have internal predecessors, (2372), 0 states have call successors, (0), 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:44,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2372 transitions. [2025-03-08 23:14:44,311 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2372 transitions. Word has length 23 [2025-03-08 23:14:44,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,311 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2372 transitions. [2025-03-08 23:14:44,311 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:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2372 transitions. [2025-03-08 23:14:44,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:44,313 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,313 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:44,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 23:14:44,313 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,314 INFO L85 PathProgramCache]: Analyzing trace with hash -339177800, now seen corresponding path program 1 times [2025-03-08 23:14:44,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-08 23:14:44,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:44,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:44,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,331 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:44,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-08 23:14:44,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459864890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003076998] [2025-03-08 23:14:44,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,332 INFO L87 Difference]: Start difference. First operand 1734 states and 2372 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:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,350 INFO L93 Difference]: Finished difference Result 2953 states and 4038 transitions. [2025-03-08 23:14:44,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,350 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:44,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,357 INFO L225 Difference]: With dead ends: 2953 [2025-03-08 23:14:44,357 INFO L226 Difference]: Without dead ends: 2953 [2025-03-08 23:14:44,357 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:44,358 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 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:44,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 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:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2025-03-08 23:14:44,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2566. [2025-03-08 23:14:44,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.3239766081871345) internal successors, (3396), 2565 states have internal predecessors, (3396), 0 states have call successors, (0), 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:44,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3396 transitions. [2025-03-08 23:14:44,395 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3396 transitions. Word has length 23 [2025-03-08 23:14:44,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,395 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3396 transitions. [2025-03-08 23:14:44,395 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:44,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3396 transitions. [2025-03-08 23:14:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 23:14:44,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,397 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:44,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 23:14:44,397 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,398 INFO L85 PathProgramCache]: Analyzing trace with hash -632580807, now seen corresponding path program 1 times [2025-03-08 23:14:44,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-08 23:14:44,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 23:14:44,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 23:14:44,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,418 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:44,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691038950] [2025-03-08 23:14:44,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691038950] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001638856] [2025-03-08 23:14:44,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,419 INFO L87 Difference]: Start difference. First operand 2566 states and 3396 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:44,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,438 INFO L93 Difference]: Finished difference Result 3337 states and 4294 transitions. [2025-03-08 23:14:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,440 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:44,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,448 INFO L225 Difference]: With dead ends: 3337 [2025-03-08 23:14:44,448 INFO L226 Difference]: Without dead ends: 3337 [2025-03-08 23:14:44,448 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:44,449 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 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:44,449 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 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:44,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2025-03-08 23:14:44,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3334. [2025-03-08 23:14:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.2877287728772877) internal successors, (4292), 3333 states have internal predecessors, (4292), 0 states have call successors, (0), 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:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4292 transitions. [2025-03-08 23:14:44,502 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4292 transitions. Word has length 23 [2025-03-08 23:14:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,503 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4292 transitions. [2025-03-08 23:14:44,503 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:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4292 transitions. [2025-03-08 23:14:44,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:44,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,505 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:44,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 23:14:44,506 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1923761283, now seen corresponding path program 1 times [2025-03-08 23:14:44,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-08 23:14:44,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:44,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:44,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,526 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:44,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418507168] [2025-03-08 23:14:44,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418507168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322524312] [2025-03-08 23:14:44,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,528 INFO L87 Difference]: Start difference. First operand 3334 states and 4292 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:44,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,544 INFO L93 Difference]: Finished difference Result 3401 states and 4294 transitions. [2025-03-08 23:14:44,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,545 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:44,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,552 INFO L225 Difference]: With dead ends: 3401 [2025-03-08 23:14:44,553 INFO L226 Difference]: Without dead ends: 3401 [2025-03-08 23:14:44,553 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:44,553 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 123 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:44,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 123 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:44,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-03-08 23:14:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3398. [2025-03-08 23:14:44,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.2634677656755962) internal successors, (4292), 3397 states have internal predecessors, (4292), 0 states have call successors, (0), 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:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4292 transitions. [2025-03-08 23:14:44,598 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4292 transitions. Word has length 24 [2025-03-08 23:14:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,598 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 4292 transitions. [2025-03-08 23:14:44,598 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:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4292 transitions. [2025-03-08 23:14:44,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:44,601 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,601 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:44,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 23:14:44,601 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1865647388, now seen corresponding path program 1 times [2025-03-08 23:14:44,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-08 23:14:44,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:44,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:44,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,618 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:44,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334140648] [2025-03-08 23:14:44,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334140648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823142964] [2025-03-08 23:14:44,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,620 INFO L87 Difference]: Start difference. First operand 3398 states and 4292 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:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,644 INFO L93 Difference]: Finished difference Result 5641 states and 7046 transitions. [2025-03-08 23:14:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,645 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:44,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,665 INFO L225 Difference]: With dead ends: 5641 [2025-03-08 23:14:44,665 INFO L226 Difference]: Without dead ends: 5641 [2025-03-08 23:14:44,665 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:44,666 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 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:44,666 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 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:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2025-03-08 23:14:44,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5126. [2025-03-08 23:14:44,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5126 states, 5125 states have (on average 1.2245853658536585) internal successors, (6276), 5125 states have internal predecessors, (6276), 0 states have call successors, (0), 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:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 6276 transitions. [2025-03-08 23:14:44,775 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 6276 transitions. Word has length 24 [2025-03-08 23:14:44,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,775 INFO L471 AbstractCegarLoop]: Abstraction has 5126 states and 6276 transitions. [2025-03-08 23:14:44,775 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:44,775 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 6276 transitions. [2025-03-08 23:14:44,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 23:14:44,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,781 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:44,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 23:14:44,782 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1572244381, now seen corresponding path program 1 times [2025-03-08 23:14:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-03-08 23:14:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 23:14:44,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 23:14:44,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:44,802 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:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068833806] [2025-03-08 23:14:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068833806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963213331] [2025-03-08 23:14:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:44,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:44,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:44,804 INFO L87 Difference]: Start difference. First operand 5126 states and 6276 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:44,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:44,840 INFO L93 Difference]: Finished difference Result 6537 states and 7686 transitions. [2025-03-08 23:14:44,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:44,840 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:44,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:44,854 INFO L225 Difference]: With dead ends: 6537 [2025-03-08 23:14:44,855 INFO L226 Difference]: Without dead ends: 6537 [2025-03-08 23:14:44,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:44,855 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 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:44,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 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:44,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2025-03-08 23:14:44,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 6534. [2025-03-08 23:14:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 1.1761824582886882) internal successors, (7684), 6533 states have internal predecessors, (7684), 0 states have call successors, (0), 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:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 7684 transitions. [2025-03-08 23:14:44,982 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 7684 transitions. Word has length 24 [2025-03-08 23:14:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 6534 states and 7684 transitions. [2025-03-08 23:14:44,982 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:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 7684 transitions. [2025-03-08 23:14:44,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:44,989 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:44,989 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:44,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 23:14:44,989 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:44,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:44,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2001303378, now seen corresponding path program 1 times [2025-03-08 23:14:44,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:44,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848746356] [2025-03-08 23:14:44,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:44,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:44,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:44,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:44,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:45,013 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:45,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:45,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848746356] [2025-03-08 23:14:45,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848746356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:45,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:45,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:45,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842533449] [2025-03-08 23:14:45,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:45,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:45,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:45,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:45,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:45,015 INFO L87 Difference]: Start difference. First operand 6534 states and 7684 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:45,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:45,050 INFO L93 Difference]: Finished difference Result 6665 states and 7686 transitions. [2025-03-08 23:14:45,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:45,050 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:45,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:45,063 INFO L225 Difference]: With dead ends: 6665 [2025-03-08 23:14:45,063 INFO L226 Difference]: Without dead ends: 6665 [2025-03-08 23:14:45,064 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:45,064 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 119 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:45,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 119 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:45,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2025-03-08 23:14:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6662. [2025-03-08 23:14:45,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.1535805434619426) internal successors, (7684), 6661 states have internal predecessors, (7684), 0 states have call successors, (0), 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:45,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 7684 transitions. [2025-03-08 23:14:45,169 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 7684 transitions. Word has length 25 [2025-03-08 23:14:45,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:45,169 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 7684 transitions. [2025-03-08 23:14:45,169 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:45,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 7684 transitions. [2025-03-08 23:14:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:45,175 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:45,175 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:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 23:14:45,176 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:45,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1495744753, now seen corresponding path program 1 times [2025-03-08 23:14:45,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:45,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-08 23:14:45,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:45,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:45,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:45,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:45,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:45,203 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:45,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:45,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899638121] [2025-03-08 23:14:45,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899638121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:45,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:45,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:45,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163281213] [2025-03-08 23:14:45,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:45,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:45,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:45,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:45,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:45,204 INFO L87 Difference]: Start difference. First operand 6662 states and 7684 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:45,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:45,280 INFO L93 Difference]: Finished difference Result 10758 states and 12036 transitions. [2025-03-08 23:14:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:45,280 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:45,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:45,295 INFO L225 Difference]: With dead ends: 10758 [2025-03-08 23:14:45,295 INFO L226 Difference]: Without dead ends: 10758 [2025-03-08 23:14:45,296 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:45,296 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 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:45,296 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 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:45,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2025-03-08 23:14:45,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 10246. [2025-03-08 23:14:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10245 states have (on average 1.1248413860419717) internal successors, (11524), 10245 states have internal predecessors, (11524), 0 states have call successors, (0), 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:45,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 11524 transitions. [2025-03-08 23:14:45,411 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 11524 transitions. Word has length 25 [2025-03-08 23:14:45,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:45,411 INFO L471 AbstractCegarLoop]: Abstraction has 10246 states and 11524 transitions. [2025-03-08 23:14:45,411 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:45,411 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 11524 transitions. [2025-03-08 23:14:45,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 23:14:45,421 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 23:14:45,421 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:45,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 23:14:45,422 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-08 23:14:45,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 23:14:45,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1202341746, now seen corresponding path program 1 times [2025-03-08 23:14:45,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 23:14:45,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-03-08 23:14:45,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 23:14:45,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 23:14:45,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 23:14:45,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 23:14:45,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 23:14:45,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 23:14:45,441 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:45,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 23:14:45,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712830896] [2025-03-08 23:14:45,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712830896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 23:14:45,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 23:14:45,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 23:14:45,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690543867] [2025-03-08 23:14:45,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 23:14:45,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 23:14:45,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 23:14:45,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 23:14:45,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 23:14:45,443 INFO L87 Difference]: Start difference. First operand 10246 states and 11524 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:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 23:14:45,471 INFO L93 Difference]: Finished difference Result 12803 states and 13570 transitions. [2025-03-08 23:14:45,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 23:14:45,472 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:45,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 23:14:45,472 INFO L225 Difference]: With dead ends: 12803 [2025-03-08 23:14:45,472 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 23:14:45,472 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:45,472 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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:45,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 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:45,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 23:14:45,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 23:14:45,473 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:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 23:14:45,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-03-08 23:14:45,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 23:14:45,473 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 23:14:45,473 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:45,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 23:14:45,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 23:14:45,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-08 23:14:45,476 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-08 23:14:45,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 23:14:45,478 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] [2025-03-08 23:14:45,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 23:14:45,483 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 11:14:45 BoogieIcfgContainer [2025-03-08 23:14:45,483 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 23:14:45,484 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 23:14:45,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 23:14:45,484 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 23:14:45,485 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:42" (3/4) ... [2025-03-08 23:14:45,486 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 23:14:45,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 23:14:45,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-08 23:14:45,495 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 23:14:45,496 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 23:14:45,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 23:14:45,559 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 23:14:45,559 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 23:14:45,560 INFO L158 Benchmark]: Toolchain (without parser) took 3357.49ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 105.3MB in the beginning and 167.8MB in the end (delta: -62.5MB). Peak memory consumption was 114.5MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,560 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:45,560 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.28ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,560 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.81ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 23:14:45,560 INFO L158 Benchmark]: Boogie Preprocessor took 31.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,561 INFO L158 Benchmark]: IcfgBuilder took 253.78ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,561 INFO L158 Benchmark]: TraceAbstraction took 2791.79ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 75.7MB in the beginning and 173.1MB in the end (delta: -97.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,561 INFO L158 Benchmark]: Witness Printer took 75.68ms. Allocated memory is still 318.8MB. Free memory was 173.1MB in the beginning and 167.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 23:14:45,564 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.21ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 172.28ms. Allocated memory is still 142.6MB. Free memory was 105.3MB in the beginning and 94.4MB in the end (delta: 10.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.81ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 92.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 31.70ms. Allocated memory is still 142.6MB. Free memory was 92.5MB in the beginning and 91.4MB in the end (delta: 1.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 253.78ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 76.4MB in the end (delta: 15.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2791.79ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 75.7MB in the beginning and 173.1MB in the end (delta: -97.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Witness Printer took 75.68ms. Allocated memory is still 318.8MB. Free memory was 173.1MB in the beginning and 167.8MB in the end (delta: 5.2MB). 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, 40 locations, 68 edges, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1041 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1041 mSDsluCounter, 3390 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2087 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10246occurred in iteration=27, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 28 MinimizatonAttempts, 2098 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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:45,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE