./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_15-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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_15-2.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 ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:21:48,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:21:48,357 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:21:48,361 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:21:48,361 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:21:48,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:21:48,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:21:48,375 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:21:48,376 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:21:48,376 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:21:48,376 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:21:48,376 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:21:48,376 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:21:48,376 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:21:48,376 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:21:48,377 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:21:48,377 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:21:48,378 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:48,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:21:48,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:21:48,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:21:48,379 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 -> ad13fcacd201ae20f6800b42387b8ec1153fb1bf63cee7a12ec23f4a302be7c7 [2025-03-17 12:21:48,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:21:48,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:21:48,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:21:48,603 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:21:48,604 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:21:48,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_15-2.c [2025-03-17 12:21:49,782 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebdad1aa1/0f1abce1fe3b4c4b8a3bd95bb42a4bce/FLAG6c4b5422f [2025-03-17 12:21:49,998 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:21:49,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_15-2.c [2025-03-17 12:21:50,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebdad1aa1/0f1abce1fe3b4c4b8a3bd95bb42a4bce/FLAG6c4b5422f [2025-03-17 12:21:50,351 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebdad1aa1/0f1abce1fe3b4c4b8a3bd95bb42a4bce [2025-03-17 12:21:50,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:21:50,355 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:21:50,356 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:50,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:21:50,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:21:50,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c31d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50, skipping insertion in model container [2025-03-17 12:21:50,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,379 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:21:50,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:50,500 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:21:50,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:21:50,528 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:21:50,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50 WrapperNode [2025-03-17 12:21:50,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:21:50,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:50,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:21:50,530 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:21:50,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,538 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,551 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 206 [2025-03-17 12:21:50,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:21:50,552 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:21:50,552 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:21:50,552 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:21:50,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,561 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,562 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,579 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-17 12:21:50,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,585 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,586 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,590 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,590 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,591 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:21:50,592 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:21:50,592 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:21:50,592 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:21:50,595 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (1/1) ... [2025-03-17 12:21:50,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:21:50,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:21:50,624 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-17 12:21:50,630 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-17 12:21:50,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:21:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:21:50,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:21:50,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:21:50,704 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:21:50,706 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:21:50,945 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2025-03-17 12:21:50,945 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:21:50,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:21:50,956 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:21:50,956 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:50 BoogieIcfgContainer [2025-03-17 12:21:50,956 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:21:50,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:21:50,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:21:50,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:21:50,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:21:50" (1/3) ... [2025-03-17 12:21:50,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f16d4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:50, skipping insertion in model container [2025-03-17 12:21:50,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:21:50" (2/3) ... [2025-03-17 12:21:50,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f16d4a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:21:50, skipping insertion in model container [2025-03-17 12:21:50,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:21:50" (3/3) ... [2025-03-17 12:21:50,966 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2025-03-17 12:21:50,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:21:50,978 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_15-2.c that has 1 procedures, 56 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-17 12:21:51,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:21:51,017 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;@374a3d91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:21:51,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-17 12:21:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-17 12:21:51,024 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,025 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-17 12:21:51,025 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,030 INFO L85 PathProgramCache]: Analyzing trace with hash 5535578, now seen corresponding path program 1 times [2025-03-17 12:21:51,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638489410] [2025-03-17 12:21:51,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-17 12:21:51,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-17 12:21:51,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,136 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-17 12:21:51,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638489410] [2025-03-17 12:21:51,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638489410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:21:51,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951797143] [2025-03-17 12:21:51,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 12:21:51,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 12:21:51,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 12:21:51,160 INFO L87 Difference]: Start difference. First operand has 56 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 55 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,171 INFO L93 Difference]: Finished difference Result 56 states and 100 transitions. [2025-03-17 12:21:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 12:21:51,172 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2025-03-17 12:21:51,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,177 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:21:51,177 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:21:51,179 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-17 12:21:51,181 INFO L435 NwaCegarLoop]: 100 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, 100 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-17 12:21:51,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:21:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:21:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.8846153846153846) internal successors, (98), 53 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 98 transitions. [2025-03-17 12:21:51,206 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 98 transitions. Word has length 4 [2025-03-17 12:21:51,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,206 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 98 transitions. [2025-03-17 12:21:51,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,206 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 98 transitions. [2025-03-17 12:21:51,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 12:21:51,206 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,206 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 12:21:51,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:21:51,207 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,207 INFO L85 PathProgramCache]: Analyzing trace with hash 171705932, now seen corresponding path program 1 times [2025-03-17 12:21:51,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819347805] [2025-03-17 12:21:51,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 12:21:51,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 12:21:51,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,247 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-17 12:21:51,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819347805] [2025-03-17 12:21:51,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819347805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:21:51,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798034065] [2025-03-17 12:21:51,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,249 INFO L87 Difference]: Start difference. First operand 54 states and 98 transitions. Second operand has 3 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-17 12:21:51,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,256 INFO L93 Difference]: Finished difference Result 53 states and 97 transitions. [2025-03-17 12:21:51,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 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-17 12:21:51,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,256 INFO L225 Difference]: With dead ends: 53 [2025-03-17 12:21:51,256 INFO L226 Difference]: Without dead ends: 51 [2025-03-17 12:21:51,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-17 12:21:51,257 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 97 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-17 12:21:51,257 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-17 12:21:51,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2025-03-17 12:21:51,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.9) internal successors, (95), 50 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 95 transitions. [2025-03-17 12:21:51,261 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 95 transitions. Word has length 5 [2025-03-17 12:21:51,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,261 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 95 transitions. [2025-03-17 12:21:51,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-17 12:21:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 95 transitions. [2025-03-17 12:21:51,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:51,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,262 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-17 12:21:51,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:21:51,263 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1023115782, now seen corresponding path program 1 times [2025-03-17 12:21:51,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895044899] [2025-03-17 12:21:51,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:51,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:51,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,343 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-17 12:21:51,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895044899] [2025-03-17 12:21:51,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895044899] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616200330] [2025-03-17 12:21:51,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,344 INFO L87 Difference]: Start difference. First operand 51 states and 95 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-17 12:21:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,364 INFO L93 Difference]: Finished difference Result 100 states and 186 transitions. [2025-03-17 12:21:51,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,365 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-17 12:21:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,366 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:21:51,367 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:21:51,368 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-17 12:21:51,368 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 74 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 188 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-17 12:21:51,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:21:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 67. [2025-03-17 12:21:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.9090909090909092) internal successors, (126), 66 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 126 transitions. [2025-03-17 12:21:51,374 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 126 transitions. Word has length 22 [2025-03-17 12:21:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,374 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 126 transitions. [2025-03-17 12:21:51,375 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-17 12:21:51,375 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 126 transitions. [2025-03-17 12:21:51,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-17 12:21:51,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,376 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-17 12:21:51,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:21:51,376 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,376 INFO L85 PathProgramCache]: Analyzing trace with hash 178643911, now seen corresponding path program 1 times [2025-03-17 12:21:51,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395061132] [2025-03-17 12:21:51,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 12:21:51,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 12:21:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,429 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-17 12:21:51,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395061132] [2025-03-17 12:21:51,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395061132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383407350] [2025-03-17 12:21:51,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,430 INFO L87 Difference]: Start difference. First operand 67 states and 126 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-17 12:21:51,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,451 INFO L93 Difference]: Finished difference Result 100 states and 184 transitions. [2025-03-17 12:21:51,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,452 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-17 12:21:51,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,453 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:21:51,453 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:21:51,453 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-17 12:21:51,453 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 74 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 213 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-17 12:21:51,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 213 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:21:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2025-03-17 12:21:51,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.8958333333333333) internal successors, (182), 96 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 182 transitions. [2025-03-17 12:21:51,460 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 182 transitions. Word has length 22 [2025-03-17 12:21:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,460 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 182 transitions. [2025-03-17 12:21:51,460 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-17 12:21:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 182 transitions. [2025-03-17 12:21:51,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:51,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,461 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-17 12:21:51,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:21:51,476 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1652714818, now seen corresponding path program 1 times [2025-03-17 12:21:51,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254976877] [2025-03-17 12:21:51,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:51,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:51,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,533 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-17 12:21:51,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254976877] [2025-03-17 12:21:51,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254976877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702155281] [2025-03-17 12:21:51,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,534 INFO L87 Difference]: Start difference. First operand 97 states and 182 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-17 12:21:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,547 INFO L93 Difference]: Finished difference Result 103 states and 186 transitions. [2025-03-17 12:21:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,547 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-17 12:21:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,548 INFO L225 Difference]: With dead ends: 103 [2025-03-17 12:21:51,548 INFO L226 Difference]: Without dead ends: 103 [2025-03-17 12:21:51,548 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-17 12:21:51,549 INFO L435 NwaCegarLoop]: 153 mSDtfsCounter, 76 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 241 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-17 12:21:51,549 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 241 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-17 12:21:51,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2025-03-17 12:21:51,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.8585858585858586) internal successors, (184), 99 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 184 transitions. [2025-03-17 12:21:51,553 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 184 transitions. Word has length 23 [2025-03-17 12:21:51,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,553 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 184 transitions. [2025-03-17 12:21:51,553 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-17 12:21:51,553 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 184 transitions. [2025-03-17 12:21:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:51,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,554 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-17 12:21:51,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:21:51,554 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1243890593, now seen corresponding path program 1 times [2025-03-17 12:21:51,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994663986] [2025-03-17 12:21:51,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:51,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:51,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:51,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994663986] [2025-03-17 12:21:51,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994663986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808668224] [2025-03-17 12:21:51,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,597 INFO L87 Difference]: Start difference. First operand 100 states and 184 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-17 12:21:51,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,610 INFO L93 Difference]: Finished difference Result 192 states and 355 transitions. [2025-03-17 12:21:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,611 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-17 12:21:51,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,611 INFO L225 Difference]: With dead ends: 192 [2025-03-17 12:21:51,611 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 12:21:51,612 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-17 12:21:51,612 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 71 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 186 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-17 12:21:51,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 186 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 12:21:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 133. [2025-03-17 12:21:51,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 1.856060606060606) internal successors, (245), 132 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 245 transitions. [2025-03-17 12:21:51,621 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 245 transitions. Word has length 23 [2025-03-17 12:21:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,621 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 245 transitions. [2025-03-17 12:21:51,621 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-17 12:21:51,622 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 245 transitions. [2025-03-17 12:21:51,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 12:21:51,622 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,622 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-17 12:21:51,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:21:51,622 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,623 INFO L85 PathProgramCache]: Analyzing trace with hash 399418722, now seen corresponding path program 1 times [2025-03-17 12:21:51,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-17 12:21:51,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 12:21:51,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 12:21:51,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,659 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-17 12:21:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157456227] [2025-03-17 12:21:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157456227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650228983] [2025-03-17 12:21:51,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,661 INFO L87 Difference]: Start difference. First operand 133 states and 245 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-17 12:21:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,677 INFO L93 Difference]: Finished difference Result 194 states and 353 transitions. [2025-03-17 12:21:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,677 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-17 12:21:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,678 INFO L225 Difference]: With dead ends: 194 [2025-03-17 12:21:51,678 INFO L226 Difference]: Without dead ends: 194 [2025-03-17 12:21:51,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,679 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 73 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 214 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-17 12:21:51,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 214 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-17 12:21:51,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2025-03-17 12:21:51,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 190 states have (on average 1.8473684210526315) internal successors, (351), 190 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 351 transitions. [2025-03-17 12:21:51,685 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 351 transitions. Word has length 23 [2025-03-17 12:21:51,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,685 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 351 transitions. [2025-03-17 12:21:51,685 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-17 12:21:51,685 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 351 transitions. [2025-03-17 12:21:51,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:51,686 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,686 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-17 12:21:51,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:21:51,686 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,686 INFO L85 PathProgramCache]: Analyzing trace with hash -93207360, now seen corresponding path program 1 times [2025-03-17 12:21:51,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256180144] [2025-03-17 12:21:51,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:51,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:51,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,707 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-17 12:21:51,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256180144] [2025-03-17 12:21:51,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256180144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424226476] [2025-03-17 12:21:51,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,709 INFO L87 Difference]: Start difference. First operand 191 states and 351 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-17 12:21:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,718 INFO L93 Difference]: Finished difference Result 196 states and 353 transitions. [2025-03-17 12:21:51,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,718 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-17 12:21:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,719 INFO L225 Difference]: With dead ends: 196 [2025-03-17 12:21:51,719 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 12:21:51,720 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-17 12:21:51,720 INFO L435 NwaCegarLoop]: 150 mSDtfsCounter, 75 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 237 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-17 12:21:51,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 237 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 12:21:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2025-03-17 12:21:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 1.828125) internal successors, (351), 192 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 351 transitions. [2025-03-17 12:21:51,725 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 351 transitions. Word has length 24 [2025-03-17 12:21:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,725 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 351 transitions. [2025-03-17 12:21:51,725 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-17 12:21:51,726 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 351 transitions. [2025-03-17 12:21:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:51,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,726 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-17 12:21:51,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:21:51,726 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,727 INFO L85 PathProgramCache]: Analyzing trace with hash -502031585, now seen corresponding path program 1 times [2025-03-17 12:21:51,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975462138] [2025-03-17 12:21:51,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:51,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:51,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,747 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-17 12:21:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975462138] [2025-03-17 12:21:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975462138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091373969] [2025-03-17 12:21:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,748 INFO L87 Difference]: Start difference. First operand 193 states and 351 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-17 12:21:51,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,764 INFO L93 Difference]: Finished difference Result 368 states and 673 transitions. [2025-03-17 12:21:51,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,765 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-17 12:21:51,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,767 INFO L225 Difference]: With dead ends: 368 [2025-03-17 12:21:51,767 INFO L226 Difference]: Without dead ends: 368 [2025-03-17 12:21:51,767 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-17 12:21:51,767 INFO L435 NwaCegarLoop]: 96 mSDtfsCounter, 68 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 184 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-17 12:21:51,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 184 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-17 12:21:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 261. [2025-03-17 12:21:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 260 states have (on average 1.8115384615384615) internal successors, (471), 260 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 471 transitions. [2025-03-17 12:21:51,780 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 471 transitions. Word has length 24 [2025-03-17 12:21:51,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,780 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 471 transitions. [2025-03-17 12:21:51,781 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-17 12:21:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 471 transitions. [2025-03-17 12:21:51,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-17 12:21:51,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,784 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-17 12:21:51,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 12:21:51,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1346503456, now seen corresponding path program 1 times [2025-03-17 12:21:51,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477302383] [2025-03-17 12:21:51,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 12:21:51,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 12:21:51,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,815 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-17 12:21:51,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477302383] [2025-03-17 12:21:51,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477302383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030904397] [2025-03-17 12:21:51,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,816 INFO L87 Difference]: Start difference. First operand 261 states and 471 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-17 12:21:51,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,831 INFO L93 Difference]: Finished difference Result 376 states and 673 transitions. [2025-03-17 12:21:51,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,831 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-17 12:21:51,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,832 INFO L225 Difference]: With dead ends: 376 [2025-03-17 12:21:51,832 INFO L226 Difference]: Without dead ends: 376 [2025-03-17 12:21:51,832 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-17 12:21:51,833 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 72 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 215 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-17 12:21:51,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 215 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2025-03-17 12:21:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 373. [2025-03-17 12:21:51,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 372 states have (on average 1.803763440860215) internal successors, (671), 372 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 671 transitions. [2025-03-17 12:21:51,842 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 671 transitions. Word has length 24 [2025-03-17 12:21:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,842 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 671 transitions. [2025-03-17 12:21:51,842 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-17 12:21:51,842 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 671 transitions. [2025-03-17 12:21:51,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:51,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,844 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-17 12:21:51,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 12:21:51,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1617773243, now seen corresponding path program 1 times [2025-03-17 12:21:51,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45425402] [2025-03-17 12:21:51,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:51,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:51,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,878 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-17 12:21:51,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45425402] [2025-03-17 12:21:51,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45425402] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856801716] [2025-03-17 12:21:51,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,879 INFO L87 Difference]: Start difference. First operand 373 states and 671 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-17 12:21:51,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,891 INFO L93 Difference]: Finished difference Result 380 states and 673 transitions. [2025-03-17 12:21:51,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,891 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-17 12:21:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,892 INFO L225 Difference]: With dead ends: 380 [2025-03-17 12:21:51,892 INFO L226 Difference]: Without dead ends: 380 [2025-03-17 12:21:51,892 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-17 12:21:51,893 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 74 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 233 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-17 12:21:51,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 233 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-03-17 12:21:51,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2025-03-17 12:21:51,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 376 states have (on average 1.7845744680851063) internal successors, (671), 376 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 671 transitions. [2025-03-17 12:21:51,903 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 671 transitions. Word has length 25 [2025-03-17 12:21:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:51,904 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 671 transitions. [2025-03-17 12:21:51,904 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-17 12:21:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 671 transitions. [2025-03-17 12:21:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:51,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:51,905 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:51,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:21:51,905 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:51,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:51,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1208949018, now seen corresponding path program 1 times [2025-03-17 12:21:51,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:51,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582779060] [2025-03-17 12:21:51,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:51,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:51,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:51,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:51,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:51,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:51,976 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-17 12:21:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:51,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582779060] [2025-03-17 12:21:51,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582779060] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:51,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:51,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:51,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062854518] [2025-03-17 12:21:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:51,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:51,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:51,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:51,977 INFO L87 Difference]: Start difference. First operand 377 states and 671 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-17 12:21:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:51,992 INFO L93 Difference]: Finished difference Result 712 states and 1277 transitions. [2025-03-17 12:21:51,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:51,992 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-17 12:21:51,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:51,994 INFO L225 Difference]: With dead ends: 712 [2025-03-17 12:21:51,995 INFO L226 Difference]: Without dead ends: 712 [2025-03-17 12:21:51,995 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-17 12:21:51,995 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 65 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 182 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-17 12:21:51,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 182 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:51,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-17 12:21:52,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 517. [2025-03-17 12:21:52,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.7577519379844961) internal successors, (907), 516 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 907 transitions. [2025-03-17 12:21:52,012 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 907 transitions. Word has length 25 [2025-03-17 12:21:52,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,012 INFO L471 AbstractCegarLoop]: Abstraction has 517 states and 907 transitions. [2025-03-17 12:21:52,012 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-17 12:21:52,012 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 907 transitions. [2025-03-17 12:21:52,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-17 12:21:52,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,013 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-17 12:21:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:21:52,013 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,014 INFO L85 PathProgramCache]: Analyzing trace with hash 364477147, now seen corresponding path program 1 times [2025-03-17 12:21:52,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007229189] [2025-03-17 12:21:52,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-17 12:21:52,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-17 12:21:52,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,044 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-17 12:21:52,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007229189] [2025-03-17 12:21:52,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007229189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102782977] [2025-03-17 12:21:52,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,045 INFO L87 Difference]: Start difference. First operand 517 states and 907 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-17 12:21:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,059 INFO L93 Difference]: Finished difference Result 736 states and 1285 transitions. [2025-03-17 12:21:52,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,060 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-17 12:21:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,061 INFO L225 Difference]: With dead ends: 736 [2025-03-17 12:21:52,062 INFO L226 Difference]: Without dead ends: 736 [2025-03-17 12:21:52,062 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,062 INFO L435 NwaCegarLoop]: 130 mSDtfsCounter, 71 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 216 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-17 12:21:52,062 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 216 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2025-03-17 12:21:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 733. [2025-03-17 12:21:52,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 732 states have (on average 1.7527322404371584) internal successors, (1283), 732 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1283 transitions. [2025-03-17 12:21:52,080 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1283 transitions. Word has length 25 [2025-03-17 12:21:52,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,080 INFO L471 AbstractCegarLoop]: Abstraction has 733 states and 1283 transitions. [2025-03-17 12:21:52,080 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-17 12:21:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1283 transitions. [2025-03-17 12:21:52,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:52,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,082 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 12:21:52,083 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1176409639, now seen corresponding path program 1 times [2025-03-17 12:21:52,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134229418] [2025-03-17 12:21:52,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:52,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:52,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,113 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-17 12:21:52,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134229418] [2025-03-17 12:21:52,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134229418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459944006] [2025-03-17 12:21:52,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,114 INFO L87 Difference]: Start difference. First operand 733 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,127 INFO L93 Difference]: Finished difference Result 744 states and 1285 transitions. [2025-03-17 12:21:52,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 12:21:52,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,130 INFO L225 Difference]: With dead ends: 744 [2025-03-17 12:21:52,130 INFO L226 Difference]: Without dead ends: 744 [2025-03-17 12:21:52,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-17 12:21:52,130 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 73 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 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-17 12:21:52,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2025-03-17 12:21:52,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 741. [2025-03-17 12:21:52,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 741 states, 740 states have (on average 1.7337837837837837) internal successors, (1283), 740 states have internal predecessors, (1283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 1283 transitions. [2025-03-17 12:21:52,144 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 1283 transitions. Word has length 26 [2025-03-17 12:21:52,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,144 INFO L471 AbstractCegarLoop]: Abstraction has 741 states and 1283 transitions. [2025-03-17 12:21:52,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,144 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 1283 transitions. [2025-03-17 12:21:52,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:52,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 12:21:52,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1585233864, now seen corresponding path program 1 times [2025-03-17 12:21:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954135226] [2025-03-17 12:21:52,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:52,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:52,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,170 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-17 12:21:52,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954135226] [2025-03-17 12:21:52,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954135226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290088852] [2025-03-17 12:21:52,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,171 INFO L87 Difference]: Start difference. First operand 741 states and 1283 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,184 INFO L93 Difference]: Finished difference Result 1384 states and 2421 transitions. [2025-03-17 12:21:52,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,184 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 12:21:52,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,189 INFO L225 Difference]: With dead ends: 1384 [2025-03-17 12:21:52,189 INFO L226 Difference]: Without dead ends: 1384 [2025-03-17 12:21:52,189 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-17 12:21:52,191 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 62 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 180 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-17 12:21:52,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2025-03-17 12:21:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1029. [2025-03-17 12:21:52,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.6994163424124513) internal successors, (1747), 1028 states have internal predecessors, (1747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1747 transitions. [2025-03-17 12:21:52,209 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1747 transitions. Word has length 26 [2025-03-17 12:21:52,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,209 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1747 transitions. [2025-03-17 12:21:52,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1747 transitions. [2025-03-17 12:21:52,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-17 12:21:52,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,210 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 12:21:52,211 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1865261561, now seen corresponding path program 1 times [2025-03-17 12:21:52,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345587466] [2025-03-17 12:21:52,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 12:21:52,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 12:21:52,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,233 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-17 12:21:52,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345587466] [2025-03-17 12:21:52,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345587466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97242060] [2025-03-17 12:21:52,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,235 INFO L87 Difference]: Start difference. First operand 1029 states and 1747 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,251 INFO L93 Difference]: Finished difference Result 1448 states and 2453 transitions. [2025-03-17 12:21:52,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2025-03-17 12:21:52,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,266 INFO L225 Difference]: With dead ends: 1448 [2025-03-17 12:21:52,266 INFO L226 Difference]: Without dead ends: 1448 [2025-03-17 12:21:52,266 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-17 12:21:52,268 INFO L435 NwaCegarLoop]: 132 mSDtfsCounter, 70 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 217 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-17 12:21:52,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 217 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-03-17 12:21:52,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1445. [2025-03-17 12:21:52,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.6973684210526316) internal successors, (2451), 1444 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 2451 transitions. [2025-03-17 12:21:52,289 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 2451 transitions. Word has length 26 [2025-03-17 12:21:52,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,289 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 2451 transitions. [2025-03-17 12:21:52,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 2451 transitions. [2025-03-17 12:21:52,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:21:52,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:21:52,291 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1896739788, now seen corresponding path program 1 times [2025-03-17 12:21:52,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641442532] [2025-03-17 12:21:52,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:21:52,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:21:52,299 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,311 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-17 12:21:52,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641442532] [2025-03-17 12:21:52,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641442532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614922364] [2025-03-17 12:21:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,313 INFO L87 Difference]: Start difference. First operand 1445 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,329 INFO L93 Difference]: Finished difference Result 1464 states and 2453 transitions. [2025-03-17 12:21:52,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:21:52,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,333 INFO L225 Difference]: With dead ends: 1464 [2025-03-17 12:21:52,334 INFO L226 Difference]: Without dead ends: 1464 [2025-03-17 12:21:52,334 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-17 12:21:52,335 INFO L435 NwaCegarLoop]: 141 mSDtfsCounter, 72 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 225 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-17 12:21:52,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 225 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2025-03-17 12:21:52,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 1461. [2025-03-17 12:21:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1460 states have (on average 1.6787671232876713) internal successors, (2451), 1460 states have internal predecessors, (2451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 2451 transitions. [2025-03-17 12:21:52,356 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 2451 transitions. Word has length 27 [2025-03-17 12:21:52,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 2451 transitions. [2025-03-17 12:21:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 2451 transitions. [2025-03-17 12:21:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:21:52,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:21:52,358 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1989403283, now seen corresponding path program 1 times [2025-03-17 12:21:52,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979034838] [2025-03-17 12:21:52,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:21:52,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:21:52,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,391 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-17 12:21:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979034838] [2025-03-17 12:21:52,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979034838] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531386546] [2025-03-17 12:21:52,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,392 INFO L87 Difference]: Start difference. First operand 1461 states and 2451 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,408 INFO L93 Difference]: Finished difference Result 2696 states and 4581 transitions. [2025-03-17 12:21:52,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:21:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,416 INFO L225 Difference]: With dead ends: 2696 [2025-03-17 12:21:52,416 INFO L226 Difference]: Without dead ends: 2696 [2025-03-17 12:21:52,416 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-17 12:21:52,416 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 59 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 178 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-17 12:21:52,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 178 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2025-03-17 12:21:52,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2053. [2025-03-17 12:21:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.6388888888888888) internal successors, (3363), 2052 states have internal predecessors, (3363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 3363 transitions. [2025-03-17 12:21:52,447 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 3363 transitions. Word has length 27 [2025-03-17 12:21:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,447 INFO L471 AbstractCegarLoop]: Abstraction has 2053 states and 3363 transitions. [2025-03-17 12:21:52,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 3363 transitions. [2025-03-17 12:21:52,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-17 12:21:52,449 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 12:21:52,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1144931412, now seen corresponding path program 1 times [2025-03-17 12:21:52,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928892396] [2025-03-17 12:21:52,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-17 12:21:52,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-17 12:21:52,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928892396] [2025-03-17 12:21:52,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928892396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221367771] [2025-03-17 12:21:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,469 INFO L87 Difference]: Start difference. First operand 2053 states and 3363 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,488 INFO L93 Difference]: Finished difference Result 2856 states and 4677 transitions. [2025-03-17 12:21:52,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-03-17 12:21:52,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,495 INFO L225 Difference]: With dead ends: 2856 [2025-03-17 12:21:52,496 INFO L226 Difference]: Without dead ends: 2856 [2025-03-17 12:21:52,496 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-17 12:21:52,496 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 69 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 218 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-17 12:21:52,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2856 states. [2025-03-17 12:21:52,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2856 to 2853. [2025-03-17 12:21:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.6392005610098177) internal successors, (4675), 2852 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 4675 transitions. [2025-03-17 12:21:52,551 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 4675 transitions. Word has length 27 [2025-03-17 12:21:52,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,551 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 4675 transitions. [2025-03-17 12:21:52,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 4675 transitions. [2025-03-17 12:21:52,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:52,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,554 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 12:21:52,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1542822642, now seen corresponding path program 1 times [2025-03-17 12:21:52,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905081253] [2025-03-17 12:21:52,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:52,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:52,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,573 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-17 12:21:52,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905081253] [2025-03-17 12:21:52,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905081253] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019503471] [2025-03-17 12:21:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,575 INFO L87 Difference]: Start difference. First operand 2853 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,595 INFO L93 Difference]: Finished difference Result 2888 states and 4677 transitions. [2025-03-17 12:21:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,603 INFO L225 Difference]: With dead ends: 2888 [2025-03-17 12:21:52,603 INFO L226 Difference]: Without dead ends: 2888 [2025-03-17 12:21:52,603 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-17 12:21:52,604 INFO L435 NwaCegarLoop]: 138 mSDtfsCounter, 71 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 221 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-17 12:21:52,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 221 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2025-03-17 12:21:52,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 2885. [2025-03-17 12:21:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2885 states, 2884 states have (on average 1.6210124826629682) internal successors, (4675), 2884 states have internal predecessors, (4675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2885 states to 2885 states and 4675 transitions. [2025-03-17 12:21:52,649 INFO L78 Accepts]: Start accepts. Automaton has 2885 states and 4675 transitions. Word has length 28 [2025-03-17 12:21:52,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,649 INFO L471 AbstractCegarLoop]: Abstraction has 2885 states and 4675 transitions. [2025-03-17 12:21:52,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,649 INFO L276 IsEmpty]: Start isEmpty. Operand 2885 states and 4675 transitions. [2025-03-17 12:21:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:52,651 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,651 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 12:21:52,651 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1133998417, now seen corresponding path program 1 times [2025-03-17 12:21:52,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330308834] [2025-03-17 12:21:52,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:52,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:52,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,670 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-17 12:21:52,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330308834] [2025-03-17 12:21:52,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330308834] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801119211] [2025-03-17 12:21:52,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,672 INFO L87 Difference]: Start difference. First operand 2885 states and 4675 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,709 INFO L93 Difference]: Finished difference Result 5256 states and 8645 transitions. [2025-03-17 12:21:52,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:52,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,721 INFO L225 Difference]: With dead ends: 5256 [2025-03-17 12:21:52,721 INFO L226 Difference]: Without dead ends: 5256 [2025-03-17 12:21:52,721 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-17 12:21:52,722 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 56 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 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-17 12:21:52,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5256 states. [2025-03-17 12:21:52,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5256 to 4101. [2025-03-17 12:21:52,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.5773170731707318) internal successors, (6467), 4100 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6467 transitions. [2025-03-17 12:21:52,779 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6467 transitions. Word has length 28 [2025-03-17 12:21:52,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,779 INFO L471 AbstractCegarLoop]: Abstraction has 4101 states and 6467 transitions. [2025-03-17 12:21:52,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6467 transitions. [2025-03-17 12:21:52,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-17 12:21:52,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,783 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 12:21:52,783 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,784 INFO L85 PathProgramCache]: Analyzing trace with hash 289526546, now seen corresponding path program 1 times [2025-03-17 12:21:52,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789218483] [2025-03-17 12:21:52,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-17 12:21:52,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-17 12:21:52,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,805 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-17 12:21:52,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789218483] [2025-03-17 12:21:52,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789218483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721825628] [2025-03-17 12:21:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:52,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:52,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:52,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:52,806 INFO L87 Difference]: Start difference. First operand 4101 states and 6467 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:52,834 INFO L93 Difference]: Finished difference Result 5640 states and 8901 transitions. [2025-03-17 12:21:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:52,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-03-17 12:21:52,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:52,856 INFO L225 Difference]: With dead ends: 5640 [2025-03-17 12:21:52,859 INFO L226 Difference]: Without dead ends: 5640 [2025-03-17 12:21:52,859 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-17 12:21:52,860 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 219 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-17 12:21:52,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 219 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:52,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5640 states. [2025-03-17 12:21:52,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5640 to 5637. [2025-03-17 12:21:52,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5637 states, 5636 states have (on average 1.578956706884315) internal successors, (8899), 5636 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5637 states to 5637 states and 8899 transitions. [2025-03-17 12:21:52,973 INFO L78 Accepts]: Start accepts. Automaton has 5637 states and 8899 transitions. Word has length 28 [2025-03-17 12:21:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:52,973 INFO L471 AbstractCegarLoop]: Abstraction has 5637 states and 8899 transitions. [2025-03-17 12:21:52,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 5637 states and 8899 transitions. [2025-03-17 12:21:52,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:52,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:52,977 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:52,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 12:21:52,978 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:52,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:52,978 INFO L85 PathProgramCache]: Analyzing trace with hash 795068845, now seen corresponding path program 1 times [2025-03-17 12:21:52,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:52,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096900704] [2025-03-17 12:21:52,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:52,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:52,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:52,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:52,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:52,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:52,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-17 12:21:52,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:52,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096900704] [2025-03-17 12:21:52,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096900704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:52,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:52,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:52,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568942380] [2025-03-17 12:21:52,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:53,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:53,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:53,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:53,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,000 INFO L87 Difference]: Start difference. First operand 5637 states and 8899 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:53,037 INFO L93 Difference]: Finished difference Result 5704 states and 8901 transitions. [2025-03-17 12:21:53,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:53,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:53,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:53,046 INFO L225 Difference]: With dead ends: 5704 [2025-03-17 12:21:53,046 INFO L226 Difference]: Without dead ends: 5704 [2025-03-17 12:21:53,046 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-17 12:21:53,047 INFO L435 NwaCegarLoop]: 135 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 217 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-17 12:21:53,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 217 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5704 states. [2025-03-17 12:21:53,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5704 to 5701. [2025-03-17 12:21:53,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5701 states, 5700 states have (on average 1.5612280701754386) internal successors, (8899), 5700 states have internal predecessors, (8899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5701 states to 5701 states and 8899 transitions. [2025-03-17 12:21:53,154 INFO L78 Accepts]: Start accepts. Automaton has 5701 states and 8899 transitions. Word has length 29 [2025-03-17 12:21:53,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:53,154 INFO L471 AbstractCegarLoop]: Abstraction has 5701 states and 8899 transitions. [2025-03-17 12:21:53,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,155 INFO L276 IsEmpty]: Start isEmpty. Operand 5701 states and 8899 transitions. [2025-03-17 12:21:53,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:53,159 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:53,159 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:53,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 12:21:53,159 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:53,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:53,160 INFO L85 PathProgramCache]: Analyzing trace with hash 386244620, now seen corresponding path program 1 times [2025-03-17 12:21:53,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:53,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312555831] [2025-03-17 12:21:53,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:53,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:53,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:53,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:53,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:53,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:53,190 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-17 12:21:53,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:53,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312555831] [2025-03-17 12:21:53,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312555831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:53,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:53,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:53,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541337178] [2025-03-17 12:21:53,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:53,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:53,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:53,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:53,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,191 INFO L87 Difference]: Start difference. First operand 5701 states and 8899 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:53,244 INFO L93 Difference]: Finished difference Result 11144 states and 17029 transitions. [2025-03-17 12:21:53,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:53,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:53,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:53,262 INFO L225 Difference]: With dead ends: 11144 [2025-03-17 12:21:53,262 INFO L226 Difference]: Without dead ends: 11144 [2025-03-17 12:21:53,262 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-17 12:21:53,263 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 188 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-17 12:21:53,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 188 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11144 states. [2025-03-17 12:21:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11144 to 11141. [2025-03-17 12:21:53,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.528456014362657) internal successors, (17027), 11140 states have internal predecessors, (17027), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 17027 transitions. [2025-03-17 12:21:53,438 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 17027 transitions. Word has length 29 [2025-03-17 12:21:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 17027 transitions. [2025-03-17 12:21:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 17027 transitions. [2025-03-17 12:21:53,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:21:53,444 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:53,445 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:53,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 12:21:53,445 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:53,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:53,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1230716491, now seen corresponding path program 1 times [2025-03-17 12:21:53,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:53,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860060854] [2025-03-17 12:21:53,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:53,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:53,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:21:53,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:21:53,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:53,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:53,461 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-17 12:21:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860060854] [2025-03-17 12:21:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860060854] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:53,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:53,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:53,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135087874] [2025-03-17 12:21:53,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:53,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:53,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:53,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:53,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,462 INFO L87 Difference]: Start difference. First operand 11141 states and 17027 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:53,516 INFO L93 Difference]: Finished difference Result 13192 states and 20741 transitions. [2025-03-17 12:21:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:53,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2025-03-17 12:21:53,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:53,567 INFO L225 Difference]: With dead ends: 13192 [2025-03-17 12:21:53,567 INFO L226 Difference]: Without dead ends: 13192 [2025-03-17 12:21:53,567 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-17 12:21:53,567 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 53 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:21:53,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 236 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:53,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13192 states. [2025-03-17 12:21:53,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13192 to 11141. [2025-03-17 12:21:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11141 states, 11140 states have (on average 1.5169658886894075) internal successors, (16899), 11140 states have internal predecessors, (16899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11141 states to 11141 states and 16899 transitions. [2025-03-17 12:21:53,691 INFO L78 Accepts]: Start accepts. Automaton has 11141 states and 16899 transitions. Word has length 29 [2025-03-17 12:21:53,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:53,691 INFO L471 AbstractCegarLoop]: Abstraction has 11141 states and 16899 transitions. [2025-03-17 12:21:53,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,692 INFO L276 IsEmpty]: Start isEmpty. Operand 11141 states and 16899 transitions. [2025-03-17 12:21:53,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:21:53,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:53,698 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:53,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 12:21:53,699 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:53,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -910469109, now seen corresponding path program 1 times [2025-03-17 12:21:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:53,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441307118] [2025-03-17 12:21:53,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:53,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:53,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:21:53,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:21:53,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:53,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:53,750 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-17 12:21:53,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:53,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441307118] [2025-03-17 12:21:53,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441307118] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:53,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:53,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:53,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621474761] [2025-03-17 12:21:53,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:53,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:53,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:53,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:53,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:53,752 INFO L87 Difference]: Start difference. First operand 11141 states and 16899 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:53,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:53,786 INFO L93 Difference]: Finished difference Result 19848 states and 30597 transitions. [2025-03-17 12:21:53,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:53,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-17 12:21:53,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:53,816 INFO L225 Difference]: With dead ends: 19848 [2025-03-17 12:21:53,816 INFO L226 Difference]: Without dead ends: 19848 [2025-03-17 12:21:53,816 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-17 12:21:53,817 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 172 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-17 12:21:53,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19848 states. [2025-03-17 12:21:54,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19848 to 16261. [2025-03-17 12:21:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16261 states, 16260 states have (on average 1.4722632226322263) internal successors, (23939), 16260 states have internal predecessors, (23939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 23939 transitions. [2025-03-17 12:21:54,095 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 23939 transitions. Word has length 30 [2025-03-17 12:21:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:54,095 INFO L471 AbstractCegarLoop]: Abstraction has 16261 states and 23939 transitions. [2025-03-17 12:21:54,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,096 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 23939 transitions. [2025-03-17 12:21:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 12:21:54,111 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:54,111 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:54,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 12:21:54,111 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:54,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:54,111 INFO L85 PathProgramCache]: Analyzing trace with hash -1754940980, now seen corresponding path program 1 times [2025-03-17 12:21:54,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:54,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094110857] [2025-03-17 12:21:54,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:54,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:54,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 12:21:54,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 12:21:54,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:54,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:54,140 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-17 12:21:54,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:54,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094110857] [2025-03-17 12:21:54,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094110857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:54,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:54,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:54,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136450910] [2025-03-17 12:21:54,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:54,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:54,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:54,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:54,141 INFO L87 Difference]: Start difference. First operand 16261 states and 23939 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:54,192 INFO L93 Difference]: Finished difference Result 21896 states and 32261 transitions. [2025-03-17 12:21:54,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:54,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2025-03-17 12:21:54,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:54,227 INFO L225 Difference]: With dead ends: 21896 [2025-03-17 12:21:54,227 INFO L226 Difference]: Without dead ends: 21896 [2025-03-17 12:21:54,227 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-17 12:21:54,228 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 66 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 221 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-17 12:21:54,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 221 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:54,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21896 states. [2025-03-17 12:21:54,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21896 to 21893. [2025-03-17 12:21:54,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21893 states, 21892 states have (on average 1.473551982459346) internal successors, (32259), 21892 states have internal predecessors, (32259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21893 states to 21893 states and 32259 transitions. [2025-03-17 12:21:54,510 INFO L78 Accepts]: Start accepts. Automaton has 21893 states and 32259 transitions. Word has length 30 [2025-03-17 12:21:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:54,510 INFO L471 AbstractCegarLoop]: Abstraction has 21893 states and 32259 transitions. [2025-03-17 12:21:54,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21893 states and 32259 transitions. [2025-03-17 12:21:54,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:54,523 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:54,523 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:54,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 12:21:54,523 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:54,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:54,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1841071525, now seen corresponding path program 1 times [2025-03-17 12:21:54,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:54,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389642425] [2025-03-17 12:21:54,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:54,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:54,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:54,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:54,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:54,538 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-17 12:21:54,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:54,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389642425] [2025-03-17 12:21:54,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389642425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:54,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:54,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:54,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549712996] [2025-03-17 12:21:54,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:54,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:54,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:54,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:54,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:54,539 INFO L87 Difference]: Start difference. First operand 21893 states and 32259 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:54,582 INFO L93 Difference]: Finished difference Result 22280 states and 32517 transitions. [2025-03-17 12:21:54,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:54,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:54,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:54,613 INFO L225 Difference]: With dead ends: 22280 [2025-03-17 12:21:54,613 INFO L226 Difference]: Without dead ends: 22280 [2025-03-17 12:21:54,614 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-17 12:21:54,614 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 68 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 209 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-17 12:21:54,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 209 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22280 states. [2025-03-17 12:21:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22280 to 22277. [2025-03-17 12:21:54,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22277 states, 22276 states have (on average 1.4596426647513019) internal successors, (32515), 22276 states have internal predecessors, (32515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22277 states to 22277 states and 32515 transitions. [2025-03-17 12:21:54,842 INFO L78 Accepts]: Start accepts. Automaton has 22277 states and 32515 transitions. Word has length 31 [2025-03-17 12:21:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:54,842 INFO L471 AbstractCegarLoop]: Abstraction has 22277 states and 32515 transitions. [2025-03-17 12:21:54,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 22277 states and 32515 transitions. [2025-03-17 12:21:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:54,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:54,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:54,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 12:21:54,856 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:54,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:54,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1432247300, now seen corresponding path program 1 times [2025-03-17 12:21:54,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:54,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212517526] [2025-03-17 12:21:54,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:54,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:54,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:54,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:54,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:54,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:54,872 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-17 12:21:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212517526] [2025-03-17 12:21:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212517526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:54,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:54,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:54,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522353159] [2025-03-17 12:21:54,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:54,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:54,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:54,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:54,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:54,873 INFO L87 Difference]: Start difference. First operand 22277 states and 32515 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:54,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:54,982 INFO L93 Difference]: Finished difference Result 38920 states and 57605 transitions. [2025-03-17 12:21:54,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:54,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:54,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:55,043 INFO L225 Difference]: With dead ends: 38920 [2025-03-17 12:21:55,044 INFO L226 Difference]: Without dead ends: 38920 [2025-03-17 12:21:55,044 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-17 12:21:55,044 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 47 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 170 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-17 12:21:55,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 170 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:55,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38920 states. [2025-03-17 12:21:55,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38920 to 32773. [2025-03-17 12:21:55,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32773 states, 32772 states have (on average 1.4139814475772001) internal successors, (46339), 32772 states have internal predecessors, (46339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32773 states to 32773 states and 46339 transitions. [2025-03-17 12:21:55,466 INFO L78 Accepts]: Start accepts. Automaton has 32773 states and 46339 transitions. Word has length 31 [2025-03-17 12:21:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:55,467 INFO L471 AbstractCegarLoop]: Abstraction has 32773 states and 46339 transitions. [2025-03-17 12:21:55,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32773 states and 46339 transitions. [2025-03-17 12:21:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 12:21:55,489 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:55,489 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:55,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 12:21:55,490 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:55,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:55,490 INFO L85 PathProgramCache]: Analyzing trace with hash 587775429, now seen corresponding path program 1 times [2025-03-17 12:21:55,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:55,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335402065] [2025-03-17 12:21:55,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:55,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:55,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 12:21:55,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 12:21:55,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:55,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:21:55,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:55,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335402065] [2025-03-17 12:21:55,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335402065] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:55,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:55,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:55,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627912524] [2025-03-17 12:21:55,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:55,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:55,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:55,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:55,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:55,511 INFO L87 Difference]: Start difference. First operand 32773 states and 46339 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:55,614 INFO L93 Difference]: Finished difference Result 43528 states and 61445 transitions. [2025-03-17 12:21:55,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:55,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 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 31 [2025-03-17 12:21:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:55,686 INFO L225 Difference]: With dead ends: 43528 [2025-03-17 12:21:55,687 INFO L226 Difference]: Without dead ends: 43528 [2025-03-17 12:21:55,687 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-17 12:21:55,687 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 222 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-17 12:21:55,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 222 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43528 states. [2025-03-17 12:21:56,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43528 to 43525. [2025-03-17 12:21:56,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43525 states, 43524 states have (on average 1.4117038875103392) internal successors, (61443), 43524 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43525 states to 43525 states and 61443 transitions. [2025-03-17 12:21:56,225 INFO L78 Accepts]: Start accepts. Automaton has 43525 states and 61443 transitions. Word has length 31 [2025-03-17 12:21:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,225 INFO L471 AbstractCegarLoop]: Abstraction has 43525 states and 61443 transitions. [2025-03-17 12:21:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 43525 states and 61443 transitions. [2025-03-17 12:21:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:56,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 12:21:56,243 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1450829445, now seen corresponding path program 1 times [2025-03-17 12:21:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450060311] [2025-03-17 12:21:56,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:56,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:56,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,259 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-17 12:21:56,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450060311] [2025-03-17 12:21:56,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450060311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49173537] [2025-03-17 12:21:56,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,261 INFO L87 Difference]: Start difference. First operand 43525 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:56,335 INFO L93 Difference]: Finished difference Result 44040 states and 61445 transitions. [2025-03-17 12:21:56,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:56,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:21:56,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:56,375 INFO L225 Difference]: With dead ends: 44040 [2025-03-17 12:21:56,375 INFO L226 Difference]: Without dead ends: 44040 [2025-03-17 12:21:56,375 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-17 12:21:56,376 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 205 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-17 12:21:56,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 205 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:56,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44040 states. [2025-03-17 12:21:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44040 to 44037. [2025-03-17 12:21:56,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44037 states, 44036 states have (on average 1.395290217095104) internal successors, (61443), 44036 states have internal predecessors, (61443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44037 states to 44037 states and 61443 transitions. [2025-03-17 12:21:56,942 INFO L78 Accepts]: Start accepts. Automaton has 44037 states and 61443 transitions. Word has length 32 [2025-03-17 12:21:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:56,942 INFO L471 AbstractCegarLoop]: Abstraction has 44037 states and 61443 transitions. [2025-03-17 12:21:56,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:56,942 INFO L276 IsEmpty]: Start isEmpty. Operand 44037 states and 61443 transitions. [2025-03-17 12:21:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:56,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:56,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:56,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 12:21:56,959 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:56,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:56,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1042005220, now seen corresponding path program 1 times [2025-03-17 12:21:56,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:56,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634384023] [2025-03-17 12:21:56,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:56,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:56,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:56,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:56,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:56,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:56,978 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-17 12:21:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634384023] [2025-03-17 12:21:56,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634384023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:56,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376935903] [2025-03-17 12:21:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:56,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:56,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:56,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:56,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:56,981 INFO L87 Difference]: Start difference. First operand 44037 states and 61443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:57,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:57,093 INFO L93 Difference]: Finished difference Result 75784 states and 107013 transitions. [2025-03-17 12:21:57,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:57,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:21:57,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:57,171 INFO L225 Difference]: With dead ends: 75784 [2025-03-17 12:21:57,171 INFO L226 Difference]: Without dead ends: 75784 [2025-03-17 12:21:57,172 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-17 12:21:57,174 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 44 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 168 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-17 12:21:57,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:57,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75784 states. [2025-03-17 12:21:57,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75784 to 65541. [2025-03-17 12:21:57,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65541 states, 65540 states have (on average 1.3515257857796765) internal successors, (88579), 65540 states have internal predecessors, (88579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:58,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65541 states to 65541 states and 88579 transitions. [2025-03-17 12:21:58,028 INFO L78 Accepts]: Start accepts. Automaton has 65541 states and 88579 transitions. Word has length 32 [2025-03-17 12:21:58,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:58,029 INFO L471 AbstractCegarLoop]: Abstraction has 65541 states and 88579 transitions. [2025-03-17 12:21:58,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:58,029 INFO L276 IsEmpty]: Start isEmpty. Operand 65541 states and 88579 transitions. [2025-03-17 12:21:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-17 12:21:58,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:58,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:58,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 12:21:58,071 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:58,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:58,071 INFO L85 PathProgramCache]: Analyzing trace with hash 197533349, now seen corresponding path program 1 times [2025-03-17 12:21:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:58,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317764563] [2025-03-17 12:21:58,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:58,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 12:21:58,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 12:21:58,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:58,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:58,091 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-17 12:21:58,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:58,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317764563] [2025-03-17 12:21:58,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317764563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:58,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:58,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:58,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571806245] [2025-03-17 12:21:58,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:58,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:58,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:58,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:58,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:58,092 INFO L87 Difference]: Start difference. First operand 65541 states and 88579 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:58,274 INFO L93 Difference]: Finished difference Result 86024 states and 115717 transitions. [2025-03-17 12:21:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-03-17 12:21:58,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:58,361 INFO L225 Difference]: With dead ends: 86024 [2025-03-17 12:21:58,361 INFO L226 Difference]: Without dead ends: 86024 [2025-03-17 12:21:58,362 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-17 12:21:58,362 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 223 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-17 12:21:58,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 223 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86024 states. [2025-03-17 12:21:59,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86024 to 86021. [2025-03-17 12:21:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86021 states, 86020 states have (on average 1.345210416182283) internal successors, (115715), 86020 states have internal predecessors, (115715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86021 states to 86021 states and 115715 transitions. [2025-03-17 12:21:59,318 INFO L78 Accepts]: Start accepts. Automaton has 86021 states and 115715 transitions. Word has length 32 [2025-03-17 12:21:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:21:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 86021 states and 115715 transitions. [2025-03-17 12:21:59,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 86021 states and 115715 transitions. [2025-03-17 12:21:59,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:21:59,345 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:21:59,345 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:21:59,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 12:21:59,346 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:21:59,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:21:59,346 INFO L85 PathProgramCache]: Analyzing trace with hash -2056747170, now seen corresponding path program 1 times [2025-03-17 12:21:59,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:21:59,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644673928] [2025-03-17 12:21:59,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:21:59,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:21:59,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:21:59,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:21:59,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:21:59,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:21:59,361 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-17 12:21:59,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:21:59,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644673928] [2025-03-17 12:21:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644673928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:21:59,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:21:59,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:21:59,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72700866] [2025-03-17 12:21:59,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:21:59,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:21:59,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:21:59,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:21:59,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:21:59,363 INFO L87 Difference]: Start difference. First operand 86021 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:21:59,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:21:59,503 INFO L93 Difference]: Finished difference Result 87048 states and 115717 transitions. [2025-03-17 12:21:59,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:21:59,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-17 12:21:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:21:59,579 INFO L225 Difference]: With dead ends: 87048 [2025-03-17 12:21:59,579 INFO L226 Difference]: Without dead ends: 87048 [2025-03-17 12:21:59,579 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-17 12:21:59,579 INFO L435 NwaCegarLoop]: 123 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 201 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-17 12:21:59,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 201 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:21:59,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87048 states. [2025-03-17 12:22:00,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87048 to 87045. [2025-03-17 12:22:00,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87045 states, 87044 states have (on average 1.3293851385506181) internal successors, (115715), 87044 states have internal predecessors, (115715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87045 states to 87045 states and 115715 transitions. [2025-03-17 12:22:00,788 INFO L78 Accepts]: Start accepts. Automaton has 87045 states and 115715 transitions. Word has length 33 [2025-03-17 12:22:00,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:00,788 INFO L471 AbstractCegarLoop]: Abstraction has 87045 states and 115715 transitions. [2025-03-17 12:22:00,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 87045 states and 115715 transitions. [2025-03-17 12:22:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:22:00,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:00,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:00,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-17 12:22:00,815 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:00,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1829395901, now seen corresponding path program 1 times [2025-03-17 12:22:00,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:00,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188005490] [2025-03-17 12:22:00,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:00,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:00,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:22:00,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:22:00,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:00,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:00,839 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-17 12:22:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188005490] [2025-03-17 12:22:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188005490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:00,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:00,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:00,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068995129] [2025-03-17 12:22:00,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:00,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:00,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:00,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:00,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:00,840 INFO L87 Difference]: Start difference. First operand 87045 states and 115715 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:01,066 INFO L93 Difference]: Finished difference Result 147464 states and 197637 transitions. [2025-03-17 12:22:01,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:01,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-17 12:22:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:01,209 INFO L225 Difference]: With dead ends: 147464 [2025-03-17 12:22:01,210 INFO L226 Difference]: Without dead ends: 147464 [2025-03-17 12:22:01,210 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-17 12:22:01,210 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 41 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 166 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-17 12:22:01,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:01,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147464 states. [2025-03-17 12:22:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147464 to 131077. [2025-03-17 12:22:02,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131077 states, 131076 states have (on average 1.2890460496200677) internal successors, (168963), 131076 states have internal predecessors, (168963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:02,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131077 states to 131077 states and 168963 transitions. [2025-03-17 12:22:02,860 INFO L78 Accepts]: Start accepts. Automaton has 131077 states and 168963 transitions. Word has length 33 [2025-03-17 12:22:02,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:02,860 INFO L471 AbstractCegarLoop]: Abstraction has 131077 states and 168963 transitions. [2025-03-17 12:22:02,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:02,860 INFO L276 IsEmpty]: Start isEmpty. Operand 131077 states and 168963 transitions. [2025-03-17 12:22:02,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:22:02,958 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:02,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:02,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-17 12:22:02,958 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:02,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:02,958 INFO L85 PathProgramCache]: Analyzing trace with hash 984924030, now seen corresponding path program 1 times [2025-03-17 12:22:02,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:02,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72483625] [2025-03-17 12:22:02,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:02,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:02,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:22:02,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:22:02,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:02,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:22:02,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:02,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72483625] [2025-03-17 12:22:02,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72483625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:02,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:02,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:02,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317783237] [2025-03-17 12:22:02,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:02,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:02,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:02,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:02,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:02,991 INFO L87 Difference]: Start difference. First operand 131077 states and 168963 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:03,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:03,392 INFO L93 Difference]: Finished difference Result 169992 states and 217093 transitions. [2025-03-17 12:22:03,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:03,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-03-17 12:22:03,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:03,926 INFO L225 Difference]: With dead ends: 169992 [2025-03-17 12:22:03,927 INFO L226 Difference]: Without dead ends: 169992 [2025-03-17 12:22:03,927 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-17 12:22:03,927 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 224 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-17 12:22:03,927 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 224 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:03,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169992 states. [2025-03-17 12:22:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169992 to 169989. [2025-03-17 12:22:05,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169989 states, 169988 states have (on average 1.2770960303080217) internal successors, (217091), 169988 states have internal predecessors, (217091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169989 states to 169989 states and 217091 transitions. [2025-03-17 12:22:05,336 INFO L78 Accepts]: Start accepts. Automaton has 169989 states and 217091 transitions. Word has length 33 [2025-03-17 12:22:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:05,336 INFO L471 AbstractCegarLoop]: Abstraction has 169989 states and 217091 transitions. [2025-03-17 12:22:05,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:05,336 INFO L276 IsEmpty]: Start isEmpty. Operand 169989 states and 217091 transitions. [2025-03-17 12:22:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:22:05,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:05,391 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:05,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-17 12:22:05,391 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:05,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:05,391 INFO L85 PathProgramCache]: Analyzing trace with hash 877520734, now seen corresponding path program 1 times [2025-03-17 12:22:05,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:05,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423801382] [2025-03-17 12:22:05,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:05,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:05,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:22:05,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:22:05,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:05,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:05,410 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-17 12:22:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:05,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423801382] [2025-03-17 12:22:05,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423801382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:05,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:05,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:05,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064486214] [2025-03-17 12:22:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:05,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:05,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:05,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:05,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:05,411 INFO L87 Difference]: Start difference. First operand 169989 states and 217091 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:06,073 INFO L93 Difference]: Finished difference Result 172040 states and 217093 transitions. [2025-03-17 12:22:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:06,073 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-17 12:22:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:06,276 INFO L225 Difference]: With dead ends: 172040 [2025-03-17 12:22:06,277 INFO L226 Difference]: Without dead ends: 172040 [2025-03-17 12:22:06,277 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-17 12:22:06,277 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 197 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-17 12:22:06,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 197 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:06,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172040 states. [2025-03-17 12:22:07,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172040 to 172037. [2025-03-17 12:22:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172037 states, 172036 states have (on average 1.2618928596340302) internal successors, (217091), 172036 states have internal predecessors, (217091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172037 states to 172037 states and 217091 transitions. [2025-03-17 12:22:08,208 INFO L78 Accepts]: Start accepts. Automaton has 172037 states and 217091 transitions. Word has length 34 [2025-03-17 12:22:08,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:08,208 INFO L471 AbstractCegarLoop]: Abstraction has 172037 states and 217091 transitions. [2025-03-17 12:22:08,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 172037 states and 217091 transitions. [2025-03-17 12:22:08,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:22:08,265 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:08,265 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:08,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-17 12:22:08,265 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:08,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:08,265 INFO L85 PathProgramCache]: Analyzing trace with hash 468696509, now seen corresponding path program 1 times [2025-03-17 12:22:08,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:08,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997792315] [2025-03-17 12:22:08,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:08,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:08,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:22:08,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:22:08,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:08,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:08,284 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-17 12:22:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997792315] [2025-03-17 12:22:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997792315] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:08,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510567699] [2025-03-17 12:22:08,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:08,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:08,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:08,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:08,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:08,286 INFO L87 Difference]: Start difference. First operand 172037 states and 217091 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:09,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:09,037 INFO L93 Difference]: Finished difference Result 286728 states and 362501 transitions. [2025-03-17 12:22:09,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:09,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-17 12:22:09,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:09,369 INFO L225 Difference]: With dead ends: 286728 [2025-03-17 12:22:09,370 INFO L226 Difference]: Without dead ends: 286728 [2025-03-17 12:22:09,370 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-17 12:22:09,370 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 164 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-17 12:22:09,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:09,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286728 states. [2025-03-17 12:22:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286728 to 262149. [2025-03-17 12:22:11,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262149 states, 262148 states have (on average 1.226555228344294) internal successors, (321539), 262148 states have internal predecessors, (321539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:12,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262149 states to 262149 states and 321539 transitions. [2025-03-17 12:22:12,314 INFO L78 Accepts]: Start accepts. Automaton has 262149 states and 321539 transitions. Word has length 34 [2025-03-17 12:22:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:12,314 INFO L471 AbstractCegarLoop]: Abstraction has 262149 states and 321539 transitions. [2025-03-17 12:22:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:12,314 INFO L276 IsEmpty]: Start isEmpty. Operand 262149 states and 321539 transitions. [2025-03-17 12:22:12,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-17 12:22:12,417 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:12,418 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:12,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-17 12:22:12,418 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:12,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:12,418 INFO L85 PathProgramCache]: Analyzing trace with hash -375775362, now seen corresponding path program 1 times [2025-03-17 12:22:12,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:12,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711370839] [2025-03-17 12:22:12,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:12,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:12,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 12:22:12,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 12:22:12,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:12,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:12,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-17 12:22:12,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:12,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711370839] [2025-03-17 12:22:12,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711370839] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:12,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:12,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729674612] [2025-03-17 12:22:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:12,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:12,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:12,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:12,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:12,445 INFO L87 Difference]: Start difference. First operand 262149 states and 321539 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:13,434 INFO L93 Difference]: Finished difference Result 335880 states and 405509 transitions. [2025-03-17 12:22:13,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:13,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-17 12:22:13,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:13,791 INFO L225 Difference]: With dead ends: 335880 [2025-03-17 12:22:13,791 INFO L226 Difference]: Without dead ends: 335880 [2025-03-17 12:22:13,792 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-17 12:22:13,792 INFO L435 NwaCegarLoop]: 148 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 225 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-17 12:22:13,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 225 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:13,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335880 states. [2025-03-17 12:22:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335880 to 335877. [2025-03-17 12:22:16,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335877 states, 335876 states have (on average 1.207311626909931) internal successors, (405507), 335876 states have internal predecessors, (405507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335877 states to 335877 states and 405507 transitions. [2025-03-17 12:22:17,770 INFO L78 Accepts]: Start accepts. Automaton has 335877 states and 405507 transitions. Word has length 34 [2025-03-17 12:22:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:22:17,770 INFO L471 AbstractCegarLoop]: Abstraction has 335877 states and 405507 transitions. [2025-03-17 12:22:17,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 335877 states and 405507 transitions. [2025-03-17 12:22:17,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:22:17,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:22:17,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:22:17,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-03-17 12:22:17,943 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-17 12:22:17,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:22:17,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1645505815, now seen corresponding path program 1 times [2025-03-17 12:22:17,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:22:17,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151481528] [2025-03-17 12:22:17,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:22:17,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:22:17,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:22:17,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:22:17,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:22:17,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:22:17,958 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-17 12:22:17,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:22:17,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151481528] [2025-03-17 12:22:17,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151481528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:22:17,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:22:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:22:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852601953] [2025-03-17 12:22:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:22:17,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:22:17,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:22:17,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:22:17,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:22:17,960 INFO L87 Difference]: Start difference. First operand 335877 states and 405507 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:22:19,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:22:19,022 INFO L93 Difference]: Finished difference Result 339976 states and 405509 transitions. [2025-03-17 12:22:19,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:22:19,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-17 12:22:19,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:22:19,460 INFO L225 Difference]: With dead ends: 339976 [2025-03-17 12:22:19,460 INFO L226 Difference]: Without dead ends: 339976 [2025-03-17 12:22:19,460 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-17 12:22:19,460 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 193 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-17 12:22:19,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:22:19,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339976 states.