./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_9.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:44:40,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:44:40,172 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:44:40,175 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:44:40,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:44:40,189 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:44:40,190 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:44:40,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:44:40,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:44:40,190 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:44:40,190 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:44:40,190 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:44:40,191 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:44:40,191 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:44:40,191 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:44:40,191 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:40,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:44:40,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:44:40,192 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-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2025-02-06 10:44:40,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:44:40,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:44:40,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:44:40,365 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:44:40,365 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:44:40,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2025-02-06 10:44:41,520 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61eb525a/7cc791c8b645474cb625920c16786f65/FLAG8ed049af5 [2025-02-06 10:44:41,736 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:44:41,739 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2025-02-06 10:44:41,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61eb525a/7cc791c8b645474cb625920c16786f65/FLAG8ed049af5 [2025-02-06 10:44:42,113 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c61eb525a/7cc791c8b645474cb625920c16786f65 [2025-02-06 10:44:42,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:44:42,116 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:44:42,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:42,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:44:42,120 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:44:42,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d03e125 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42, skipping insertion in model container [2025-02-06 10:44:42,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,133 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:44:42,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:42,272 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:44:42,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:44:42,300 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:44:42,301 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42 WrapperNode [2025-02-06 10:44:42,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:44:42,301 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:42,301 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:44:42,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:44:42,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,310 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,327 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 134 [2025-02-06 10:44:42,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:44:42,329 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:44:42,329 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:44:42,329 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:44:42,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,334 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,344 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-02-06 10:44:42,344 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,346 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,347 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:44:42,348 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:44:42,348 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:44:42,348 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:44:42,353 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (1/1) ... [2025-02-06 10:44:42,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:44:42,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:44:42,380 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 10:44:42,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 10:44:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:44:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:44:42,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:44:42,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:44:42,463 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:44:42,464 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:44:42,636 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-06 10:44:42,636 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:44:42,642 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:44:42,642 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:44:42,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:42 BoogieIcfgContainer [2025-02-06 10:44:42,642 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:44:42,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:44:42,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:44:42,647 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:44:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:44:42" (1/3) ... [2025-02-06 10:44:42,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208704bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:42, skipping insertion in model container [2025-02-06 10:44:42,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:44:42" (2/3) ... [2025-02-06 10:44:42,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@208704bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:44:42, skipping insertion in model container [2025-02-06 10:44:42,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:42" (3/3) ... [2025-02-06 10:44:42,648 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2025-02-06 10:44:42,657 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:44:42,658 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_9.c that has 1 procedures, 40 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-02-06 10:44:42,695 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:44:42,705 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;@1e2decc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:44:42,705 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-06 10:44:42,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-06 10:44:42,712 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:42,712 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 10:44:42,712 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:42,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:42,719 INFO L85 PathProgramCache]: Analyzing trace with hash 122116441, now seen corresponding path program 1 times [2025-02-06 10:44:42,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:42,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029487760] [2025-02-06 10:44:42,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:42,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:42,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 10:44:42,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 10:44:42,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:42,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:42,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:42,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:42,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029487760] [2025-02-06 10:44:42,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029487760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:42,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:42,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:44:42,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355767563] [2025-02-06 10:44:42,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:42,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 10:44:42,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:42,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 10:44:42,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 10:44:42,854 INFO L87 Difference]: Start difference. First operand has 40 states, 37 states have (on average 1.837837837837838) internal successors, (68), 39 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:42,865 INFO L93 Difference]: Finished difference Result 39 states and 65 transitions. [2025-02-06 10:44:42,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 10:44:42,866 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-06 10:44:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:42,870 INFO L225 Difference]: With dead ends: 39 [2025-02-06 10:44:42,870 INFO L226 Difference]: Without dead ends: 37 [2025-02-06 10:44:42,872 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-02-06 10:44:42,875 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:42,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-06 10:44:42,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-02-06 10:44:42,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2025-02-06 10:44:42,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 5 [2025-02-06 10:44:42,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:42,901 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2025-02-06 10:44:42,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2025-02-06 10:44:42,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-06 10:44:42,902 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:42,902 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 10:44:42,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:44:42,903 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:42,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:42,904 INFO L85 PathProgramCache]: Analyzing trace with hash -509306474, now seen corresponding path program 1 times [2025-02-06 10:44:42,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:42,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764382734] [2025-02-06 10:44:42,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:42,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:42,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 10:44:42,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 10:44:42,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:42,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:42,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764382734] [2025-02-06 10:44:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764382734] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:42,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:42,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:44:42,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636624603] [2025-02-06 10:44:42,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:42,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:42,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:42,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:42,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:42,968 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:42,977 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2025-02-06 10:44:42,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:42,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-06 10:44:42,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:42,979 INFO L225 Difference]: With dead ends: 36 [2025-02-06 10:44:42,979 INFO L226 Difference]: Without dead ends: 34 [2025-02-06 10:44:42,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:42,980 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 57 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:42,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 62 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-02-06 10:44:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-02-06 10:44:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 60 transitions. [2025-02-06 10:44:42,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 60 transitions. Word has length 6 [2025-02-06 10:44:42,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:42,988 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 60 transitions. [2025-02-06 10:44:42,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:42,988 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 60 transitions. [2025-02-06 10:44:42,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:44:42,988 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:42,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:42,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:44:42,988 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:42,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:42,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1169756173, now seen corresponding path program 1 times [2025-02-06 10:44:42,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:42,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923452568] [2025-02-06 10:44:42,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:44:43,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:44:43,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923452568] [2025-02-06 10:44:43,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923452568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699376347] [2025-02-06 10:44:43,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,080 INFO L87 Difference]: Start difference. First operand 34 states and 60 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,107 INFO L93 Difference]: Finished difference Result 65 states and 115 transitions. [2025-02-06 10:44:43,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:44:43,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,108 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:44:43,108 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:44:43,109 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-02-06 10:44:43,109 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,109 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:44:43,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 44. [2025-02-06 10:44:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.8372093023255813) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 79 transitions. [2025-02-06 10:44:43,116 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 79 transitions. Word has length 17 [2025-02-06 10:44:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,116 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 79 transitions. [2025-02-06 10:44:43,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,117 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 79 transitions. [2025-02-06 10:44:43,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:44:43,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,117 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:44:43,117 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 876353166, now seen corresponding path program 1 times [2025-02-06 10:44:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588127222] [2025-02-06 10:44:43,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:44:43,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:44:43,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588127222] [2025-02-06 10:44:43,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588127222] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318654672] [2025-02-06 10:44:43,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,185 INFO L87 Difference]: Start difference. First operand 44 states and 79 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,205 INFO L93 Difference]: Finished difference Result 65 states and 113 transitions. [2025-02-06 10:44:43,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-06 10:44:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,206 INFO L225 Difference]: With dead ends: 65 [2025-02-06 10:44:43,206 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:44:43,206 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-02-06 10:44:43,207 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 44 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 131 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:44:43,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2025-02-06 10:44:43,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.819672131147541) internal successors, (111), 61 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 111 transitions. [2025-02-06 10:44:43,213 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 111 transitions. Word has length 17 [2025-02-06 10:44:43,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,213 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 111 transitions. [2025-02-06 10:44:43,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,213 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 111 transitions. [2025-02-06 10:44:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:44:43,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:44:43,214 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1903559282, now seen corresponding path program 1 times [2025-02-06 10:44:43,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987719982] [2025-02-06 10:44:43,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:44:43,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:44:43,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987719982] [2025-02-06 10:44:43,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987719982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589680299] [2025-02-06 10:44:43,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,273 INFO L87 Difference]: Start difference. First operand 62 states and 111 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,287 INFO L93 Difference]: Finished difference Result 68 states and 115 transitions. [2025-02-06 10:44:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:44:43,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,288 INFO L225 Difference]: With dead ends: 68 [2025-02-06 10:44:43,289 INFO L226 Difference]: Without dead ends: 68 [2025-02-06 10:44:43,289 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-02-06 10:44:43,289 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 46 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-02-06 10:44:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2025-02-06 10:44:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.765625) internal successors, (113), 64 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 113 transitions. [2025-02-06 10:44:43,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 113 transitions. Word has length 18 [2025-02-06 10:44:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,296 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 113 transitions. [2025-02-06 10:44:43,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,296 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 113 transitions. [2025-02-06 10:44:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:44:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,296 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:44:43,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1398000657, now seen corresponding path program 1 times [2025-02-06 10:44:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383527180] [2025-02-06 10:44:43,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:44:43,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:44:43,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383527180] [2025-02-06 10:44:43,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383527180] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246174711] [2025-02-06 10:44:43,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,336 INFO L87 Difference]: Start difference. First operand 65 states and 113 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,346 INFO L93 Difference]: Finished difference Result 121 states and 212 transitions. [2025-02-06 10:44:43,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:44:43,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,347 INFO L225 Difference]: With dead ends: 121 [2025-02-06 10:44:43,347 INFO L226 Difference]: Without dead ends: 121 [2025-02-06 10:44:43,347 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-02-06 10:44:43,348 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 41 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-06 10:44:43,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 86. [2025-02-06 10:44:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.7647058823529411) internal successors, (150), 85 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 150 transitions. [2025-02-06 10:44:43,352 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 150 transitions. Word has length 18 [2025-02-06 10:44:43,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,353 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 150 transitions. [2025-02-06 10:44:43,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 150 transitions. [2025-02-06 10:44:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-02-06 10:44:43,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 10:44:43,354 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1104597650, now seen corresponding path program 1 times [2025-02-06 10:44:43,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019494975] [2025-02-06 10:44:43,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 10:44:43,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 10:44:43,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019494975] [2025-02-06 10:44:43,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019494975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750714309] [2025-02-06 10:44:43,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,377 INFO L87 Difference]: Start difference. First operand 86 states and 150 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,389 INFO L93 Difference]: Finished difference Result 123 states and 210 transitions. [2025-02-06 10:44:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-02-06 10:44:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,390 INFO L225 Difference]: With dead ends: 123 [2025-02-06 10:44:43,390 INFO L226 Difference]: Without dead ends: 123 [2025-02-06 10:44:43,390 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-02-06 10:44:43,390 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,390 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 132 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-02-06 10:44:43,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2025-02-06 10:44:43,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 119 states have (on average 1.7478991596638656) internal successors, (208), 119 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 208 transitions. [2025-02-06 10:44:43,395 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 208 transitions. Word has length 18 [2025-02-06 10:44:43,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,395 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 208 transitions. [2025-02-06 10:44:43,395 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 208 transitions. [2025-02-06 10:44:43,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:44:43,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,396 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,396 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:44:43,396 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,396 INFO L85 PathProgramCache]: Analyzing trace with hash 389196967, now seen corresponding path program 1 times [2025-02-06 10:44:43,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537839717] [2025-02-06 10:44:43,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:44:43,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:44:43,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537839717] [2025-02-06 10:44:43,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537839717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222483197] [2025-02-06 10:44:43,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,417 INFO L87 Difference]: Start difference. First operand 120 states and 208 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,426 INFO L93 Difference]: Finished difference Result 125 states and 210 transitions. [2025-02-06 10:44:43,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:44:43,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,427 INFO L225 Difference]: With dead ends: 125 [2025-02-06 10:44:43,427 INFO L226 Difference]: Without dead ends: 125 [2025-02-06 10:44:43,427 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-02-06 10:44:43,427 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-02-06 10:44:43,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2025-02-06 10:44:43,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 1.71900826446281) internal successors, (208), 121 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 208 transitions. [2025-02-06 10:44:43,432 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 208 transitions. Word has length 19 [2025-02-06 10:44:43,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,432 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 208 transitions. [2025-02-06 10:44:43,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,432 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 208 transitions. [2025-02-06 10:44:43,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:44:43,432 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,432 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:44:43,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,433 INFO L85 PathProgramCache]: Analyzing trace with hash -116361658, now seen corresponding path program 1 times [2025-02-06 10:44:43,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419337416] [2025-02-06 10:44:43,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:44:43,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:44:43,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419337416] [2025-02-06 10:44:43,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419337416] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271919065] [2025-02-06 10:44:43,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,476 INFO L87 Difference]: Start difference. First operand 122 states and 208 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,491 INFO L93 Difference]: Finished difference Result 225 states and 386 transitions. [2025-02-06 10:44:43,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:44:43,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,493 INFO L225 Difference]: With dead ends: 225 [2025-02-06 10:44:43,493 INFO L226 Difference]: Without dead ends: 225 [2025-02-06 10:44:43,493 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-02-06 10:44:43,493 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 38 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2025-02-06 10:44:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 166. [2025-02-06 10:44:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 165 states have (on average 1.696969696969697) internal successors, (280), 165 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 280 transitions. [2025-02-06 10:44:43,501 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 280 transitions. Word has length 19 [2025-02-06 10:44:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,501 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 280 transitions. [2025-02-06 10:44:43,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 280 transitions. [2025-02-06 10:44:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-06 10:44:43,502 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,502 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 10:44:43,502 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,504 INFO L85 PathProgramCache]: Analyzing trace with hash -409764665, now seen corresponding path program 1 times [2025-02-06 10:44:43,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342880359] [2025-02-06 10:44:43,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 10:44:43,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 10:44:43,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342880359] [2025-02-06 10:44:43,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342880359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477407959] [2025-02-06 10:44:43,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,526 INFO L87 Difference]: Start difference. First operand 166 states and 280 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,536 INFO L93 Difference]: Finished difference Result 233 states and 386 transitions. [2025-02-06 10:44:43,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-06 10:44:43,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,537 INFO L225 Difference]: With dead ends: 233 [2025-02-06 10:44:43,537 INFO L226 Difference]: Without dead ends: 233 [2025-02-06 10:44:43,537 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-02-06 10:44:43,537 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2025-02-06 10:44:43,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2025-02-06 10:44:43,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.6768558951965065) internal successors, (384), 229 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 384 transitions. [2025-02-06 10:44:43,544 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 384 transitions. Word has length 19 [2025-02-06 10:44:43,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,544 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 384 transitions. [2025-02-06 10:44:43,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 384 transitions. [2025-02-06 10:44:43,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:44:43,545 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 10:44:43,546 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,547 INFO L85 PathProgramCache]: Analyzing trace with hash 688598731, now seen corresponding path program 1 times [2025-02-06 10:44:43,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283475901] [2025-02-06 10:44:43,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:44:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:44:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283475901] [2025-02-06 10:44:43,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283475901] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768366499] [2025-02-06 10:44:43,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,567 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,568 INFO L87 Difference]: Start difference. First operand 230 states and 384 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,576 INFO L93 Difference]: Finished difference Result 237 states and 386 transitions. [2025-02-06 10:44:43,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:44:43,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,578 INFO L225 Difference]: With dead ends: 237 [2025-02-06 10:44:43,578 INFO L226 Difference]: Without dead ends: 237 [2025-02-06 10:44:43,578 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-02-06 10:44:43,578 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2025-02-06 10:44:43,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2025-02-06 10:44:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 1.648068669527897) internal successors, (384), 233 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 384 transitions. [2025-02-06 10:44:43,583 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 384 transitions. Word has length 20 [2025-02-06 10:44:43,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,583 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 384 transitions. [2025-02-06 10:44:43,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 384 transitions. [2025-02-06 10:44:43,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:44:43,584 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 10:44:43,584 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,584 INFO L85 PathProgramCache]: Analyzing trace with hash 183040106, now seen corresponding path program 1 times [2025-02-06 10:44:43,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994553466] [2025-02-06 10:44:43,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:44:43,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:44:43,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994553466] [2025-02-06 10:44:43,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994553466] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607615179] [2025-02-06 10:44:43,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,602 INFO L87 Difference]: Start difference. First operand 234 states and 384 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,610 INFO L93 Difference]: Finished difference Result 425 states and 702 transitions. [2025-02-06 10:44:43,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:44:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,612 INFO L225 Difference]: With dead ends: 425 [2025-02-06 10:44:43,612 INFO L226 Difference]: Without dead ends: 425 [2025-02-06 10:44:43,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-02-06 10:44:43,612 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 35 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2025-02-06 10:44:43,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 326. [2025-02-06 10:44:43,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.6123076923076922) internal successors, (524), 325 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 524 transitions. [2025-02-06 10:44:43,618 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 524 transitions. Word has length 20 [2025-02-06 10:44:43,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,618 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 524 transitions. [2025-02-06 10:44:43,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,618 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 524 transitions. [2025-02-06 10:44:43,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-02-06 10:44:43,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,619 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:44:43,619 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,619 INFO L85 PathProgramCache]: Analyzing trace with hash -110362901, now seen corresponding path program 1 times [2025-02-06 10:44:43,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974684102] [2025-02-06 10:44:43,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 10:44:43,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 10:44:43,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974684102] [2025-02-06 10:44:43,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974684102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47520432] [2025-02-06 10:44:43,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,635 INFO L87 Difference]: Start difference. First operand 326 states and 524 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,643 INFO L93 Difference]: Finished difference Result 449 states and 710 transitions. [2025-02-06 10:44:43,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-02-06 10:44:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,645 INFO L225 Difference]: With dead ends: 449 [2025-02-06 10:44:43,645 INFO L226 Difference]: Without dead ends: 449 [2025-02-06 10:44:43,645 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-02-06 10:44:43,645 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 41 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2025-02-06 10:44:43,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2025-02-06 10:44:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.5910112359550561) internal successors, (708), 445 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 708 transitions. [2025-02-06 10:44:43,652 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 708 transitions. Word has length 20 [2025-02-06 10:44:43,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,652 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 708 transitions. [2025-02-06 10:44:43,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,652 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 708 transitions. [2025-02-06 10:44:43,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:44:43,653 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,653 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 10:44:43,653 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1380112096, now seen corresponding path program 1 times [2025-02-06 10:44:43,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801149106] [2025-02-06 10:44:43,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:44:43,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:44:43,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,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-02-06 10:44:43,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801149106] [2025-02-06 10:44:43,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801149106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908141564] [2025-02-06 10:44:43,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,671 INFO L87 Difference]: Start difference. First operand 446 states and 708 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,679 INFO L93 Difference]: Finished difference Result 457 states and 710 transitions. [2025-02-06 10:44:43,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:44:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,681 INFO L225 Difference]: With dead ends: 457 [2025-02-06 10:44:43,683 INFO L226 Difference]: Without dead ends: 457 [2025-02-06 10:44:43,683 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-02-06 10:44:43,684 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 43 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-02-06 10:44:43,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 454. [2025-02-06 10:44:43,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.5629139072847682) internal successors, (708), 453 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 708 transitions. [2025-02-06 10:44:43,696 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 708 transitions. Word has length 21 [2025-02-06 10:44:43,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,696 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 708 transitions. [2025-02-06 10:44:43,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,697 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 708 transitions. [2025-02-06 10:44:43,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:44:43,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,697 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 10:44:43,697 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,698 INFO L85 PathProgramCache]: Analyzing trace with hash 874553471, now seen corresponding path program 1 times [2025-02-06 10:44:43,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5693160] [2025-02-06 10:44:43,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:44:43,702 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:44:43,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5693160] [2025-02-06 10:44:43,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5693160] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90965274] [2025-02-06 10:44:43,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,714 INFO L87 Difference]: Start difference. First operand 454 states and 708 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,723 INFO L93 Difference]: Finished difference Result 809 states and 1270 transitions. [2025-02-06 10:44:43,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:44:43,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,725 INFO L225 Difference]: With dead ends: 809 [2025-02-06 10:44:43,725 INFO L226 Difference]: Without dead ends: 809 [2025-02-06 10:44:43,725 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-02-06 10:44:43,725 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 32 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2025-02-06 10:44:43,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 646. [2025-02-06 10:44:43,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 645 states have (on average 1.5193798449612403) internal successors, (980), 645 states have internal predecessors, (980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 980 transitions. [2025-02-06 10:44:43,735 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 980 transitions. Word has length 21 [2025-02-06 10:44:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,735 INFO L471 AbstractCegarLoop]: Abstraction has 646 states and 980 transitions. [2025-02-06 10:44:43,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 980 transitions. [2025-02-06 10:44:43,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-06 10:44:43,736 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,736 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:43,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 10:44:43,736 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,736 INFO L85 PathProgramCache]: Analyzing trace with hash 581150464, now seen corresponding path program 1 times [2025-02-06 10:44:43,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878272695] [2025-02-06 10:44:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 10:44:43,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 10:44:43,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,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-02-06 10:44:43,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878272695] [2025-02-06 10:44:43,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878272695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709267796] [2025-02-06 10:44:43,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,750 INFO L87 Difference]: Start difference. First operand 646 states and 980 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,761 INFO L93 Difference]: Finished difference Result 873 states and 1302 transitions. [2025-02-06 10:44:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-06 10:44:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,765 INFO L225 Difference]: With dead ends: 873 [2025-02-06 10:44:43,765 INFO L226 Difference]: Without dead ends: 873 [2025-02-06 10:44:43,765 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-02-06 10:44:43,765 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-02-06 10:44:43,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 870. [2025-02-06 10:44:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.4959723820483315) internal successors, (1300), 869 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1300 transitions. [2025-02-06 10:44:43,779 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1300 transitions. Word has length 21 [2025-02-06 10:44:43,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,779 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1300 transitions. [2025-02-06 10:44:43,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,779 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1300 transitions. [2025-02-06 10:44:43,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:43,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,780 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-02-06 10:44:43,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 10:44:43,780 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1342183204, now seen corresponding path program 1 times [2025-02-06 10:44:43,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358252220] [2025-02-06 10:44:43,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:43,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:43,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358252220] [2025-02-06 10:44:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358252220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122117040] [2025-02-06 10:44:43,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,819 INFO L87 Difference]: Start difference. First operand 870 states and 1300 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,830 INFO L93 Difference]: Finished difference Result 889 states and 1302 transitions. [2025-02-06 10:44:43,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,831 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-02-06 10:44:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,833 INFO L225 Difference]: With dead ends: 889 [2025-02-06 10:44:43,833 INFO L226 Difference]: Without dead ends: 889 [2025-02-06 10:44:43,833 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-02-06 10:44:43,834 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2025-02-06 10:44:43,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 886. [2025-02-06 10:44:43,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 885 states have (on average 1.4689265536723164) internal successors, (1300), 885 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1300 transitions. [2025-02-06 10:44:43,849 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1300 transitions. Word has length 22 [2025-02-06 10:44:43,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,849 INFO L471 AbstractCegarLoop]: Abstraction has 886 states and 1300 transitions. [2025-02-06 10:44:43,849 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-02-06 10:44:43,849 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1300 transitions. [2025-02-06 10:44:43,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:43,851 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,851 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-02-06 10:44:43,851 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 10:44:43,852 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,853 INFO L85 PathProgramCache]: Analyzing trace with hash 836624579, now seen corresponding path program 1 times [2025-02-06 10:44:43,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712077815] [2025-02-06 10:44:43,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:43,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:43,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712077815] [2025-02-06 10:44:43,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712077815] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070447628] [2025-02-06 10:44:43,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,880 INFO L87 Difference]: Start difference. First operand 886 states and 1300 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,893 INFO L93 Difference]: Finished difference Result 1545 states and 2278 transitions. [2025-02-06 10:44:43,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,893 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-02-06 10:44:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,896 INFO L225 Difference]: With dead ends: 1545 [2025-02-06 10:44:43,897 INFO L226 Difference]: Without dead ends: 1545 [2025-02-06 10:44:43,897 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-02-06 10:44:43,897 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1545 states. [2025-02-06 10:44:43,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1545 to 1286. [2025-02-06 10:44:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1285 states have (on average 1.422568093385214) internal successors, (1828), 1285 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 1828 transitions. [2025-02-06 10:44:43,914 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 1828 transitions. Word has length 22 [2025-02-06 10:44:43,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,914 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 1828 transitions. [2025-02-06 10:44:43,914 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-02-06 10:44:43,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 1828 transitions. [2025-02-06 10:44:43,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-06 10:44:43,916 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,916 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-02-06 10:44:43,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 10:44:43,916 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,917 INFO L85 PathProgramCache]: Analyzing trace with hash 543221572, now seen corresponding path program 1 times [2025-02-06 10:44:43,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544752395] [2025-02-06 10:44:43,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 10:44:43,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 10:44:43,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:43,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:43,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:43,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544752395] [2025-02-06 10:44:43,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544752395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:43,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:43,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:43,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196394960] [2025-02-06 10:44:43,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:43,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:43,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:43,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:43,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:43,938 INFO L87 Difference]: Start difference. First operand 1286 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:43,955 INFO L93 Difference]: Finished difference Result 1705 states and 2374 transitions. [2025-02-06 10:44:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:43,955 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-02-06 10:44:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:43,959 INFO L225 Difference]: With dead ends: 1705 [2025-02-06 10:44:43,959 INFO L226 Difference]: Without dead ends: 1705 [2025-02-06 10:44:43,959 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-02-06 10:44:43,959 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:43,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2025-02-06 10:44:43,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1702. [2025-02-06 10:44:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1702 states, 1701 states have (on average 1.3944738389182834) internal successors, (2372), 1701 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 2372 transitions. [2025-02-06 10:44:43,980 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 2372 transitions. Word has length 22 [2025-02-06 10:44:43,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:43,980 INFO L471 AbstractCegarLoop]: Abstraction has 1702 states and 2372 transitions. [2025-02-06 10:44:43,980 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-02-06 10:44:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 2372 transitions. [2025-02-06 10:44:43,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:43,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:43,982 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-02-06 10:44:43,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 10:44:43,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:43,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:43,982 INFO L85 PathProgramCache]: Analyzing trace with hash 166380825, now seen corresponding path program 1 times [2025-02-06 10:44:43,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:43,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237020281] [2025-02-06 10:44:43,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:43,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:43,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:43,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:43,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:43,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [237020281] [2025-02-06 10:44:44,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [237020281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972200008] [2025-02-06 10:44:44,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,009 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,009 INFO L87 Difference]: Start difference. First operand 1702 states and 2372 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,031 INFO L93 Difference]: Finished difference Result 1737 states and 2374 transitions. [2025-02-06 10:44:44,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,031 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-02-06 10:44:44,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,039 INFO L225 Difference]: With dead ends: 1737 [2025-02-06 10:44:44,039 INFO L226 Difference]: Without dead ends: 1737 [2025-02-06 10:44:44,039 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-02-06 10:44:44,039 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2025-02-06 10:44:44,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1734. [2025-02-06 10:44:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1734 states, 1733 states have (on average 1.3687247547605308) internal successors, (2372), 1733 states have internal predecessors, (2372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2372 transitions. [2025-02-06 10:44:44,060 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2372 transitions. Word has length 23 [2025-02-06 10:44:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 1734 states and 2372 transitions. [2025-02-06 10:44:44,060 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-02-06 10:44:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2372 transitions. [2025-02-06 10:44:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:44,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,061 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-02-06 10:44:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 10:44:44,061 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,062 INFO L85 PathProgramCache]: Analyzing trace with hash -339177800, now seen corresponding path program 1 times [2025-02-06 10:44:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012211237] [2025-02-06 10:44:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:44,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:44,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012211237] [2025-02-06 10:44:44,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012211237] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49686279] [2025-02-06 10:44:44,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,075 INFO L87 Difference]: Start difference. First operand 1734 states and 2372 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,090 INFO L93 Difference]: Finished difference Result 2953 states and 4038 transitions. [2025-02-06 10:44:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,090 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-02-06 10:44:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,095 INFO L225 Difference]: With dead ends: 2953 [2025-02-06 10:44:44,095 INFO L226 Difference]: Without dead ends: 2953 [2025-02-06 10:44:44,096 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-02-06 10:44:44,096 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 26 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 106 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2953 states. [2025-02-06 10:44:44,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2953 to 2566. [2025-02-06 10:44:44,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2566 states, 2565 states have (on average 1.3239766081871345) internal successors, (3396), 2565 states have internal predecessors, (3396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2566 states to 2566 states and 3396 transitions. [2025-02-06 10:44:44,141 INFO L78 Accepts]: Start accepts. Automaton has 2566 states and 3396 transitions. Word has length 23 [2025-02-06 10:44:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,142 INFO L471 AbstractCegarLoop]: Abstraction has 2566 states and 3396 transitions. [2025-02-06 10:44:44,142 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-02-06 10:44:44,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2566 states and 3396 transitions. [2025-02-06 10:44:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-06 10:44:44,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,144 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-02-06 10:44:44,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 10:44:44,145 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,145 INFO L85 PathProgramCache]: Analyzing trace with hash -632580807, now seen corresponding path program 1 times [2025-02-06 10:44:44,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698566174] [2025-02-06 10:44:44,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 10:44:44,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 10:44:44,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698566174] [2025-02-06 10:44:44,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698566174] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987581497] [2025-02-06 10:44:44,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,169 INFO L87 Difference]: Start difference. First operand 2566 states and 3396 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,198 INFO L93 Difference]: Finished difference Result 3337 states and 4294 transitions. [2025-02-06 10:44:44,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,199 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-02-06 10:44:44,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,205 INFO L225 Difference]: With dead ends: 3337 [2025-02-06 10:44:44,205 INFO L226 Difference]: Without dead ends: 3337 [2025-02-06 10:44:44,205 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-02-06 10:44:44,206 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,206 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 137 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2025-02-06 10:44:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 3334. [2025-02-06 10:44:44,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3334 states, 3333 states have (on average 1.2877287728772877) internal successors, (4292), 3333 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3334 states to 3334 states and 4292 transitions. [2025-02-06 10:44:44,245 INFO L78 Accepts]: Start accepts. Automaton has 3334 states and 4292 transitions. Word has length 23 [2025-02-06 10:44:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,245 INFO L471 AbstractCegarLoop]: Abstraction has 3334 states and 4292 transitions. [2025-02-06 10:44:44,245 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-02-06 10:44:44,245 INFO L276 IsEmpty]: Start isEmpty. Operand 3334 states and 4292 transitions. [2025-02-06 10:44:44,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:44,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,247 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-02-06 10:44:44,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 10:44:44,247 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1923761283, now seen corresponding path program 1 times [2025-02-06 10:44:44,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070130395] [2025-02-06 10:44:44,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:44,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:44,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070130395] [2025-02-06 10:44:44,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070130395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198960196] [2025-02-06 10:44:44,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,263 INFO L87 Difference]: Start difference. First operand 3334 states and 4292 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,281 INFO L93 Difference]: Finished difference Result 3401 states and 4294 transitions. [2025-02-06 10:44:44,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,281 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-02-06 10:44:44,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,288 INFO L225 Difference]: With dead ends: 3401 [2025-02-06 10:44:44,288 INFO L226 Difference]: Without dead ends: 3401 [2025-02-06 10:44:44,288 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-02-06 10:44:44,288 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3401 states. [2025-02-06 10:44:44,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3401 to 3398. [2025-02-06 10:44:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 3397 states have (on average 1.2634677656755962) internal successors, (4292), 3397 states have internal predecessors, (4292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4292 transitions. [2025-02-06 10:44:44,327 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4292 transitions. Word has length 24 [2025-02-06 10:44:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,327 INFO L471 AbstractCegarLoop]: Abstraction has 3398 states and 4292 transitions. [2025-02-06 10:44:44,327 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-02-06 10:44:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4292 transitions. [2025-02-06 10:44:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:44,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,330 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-02-06 10:44:44,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 10:44:44,330 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1865647388, now seen corresponding path program 1 times [2025-02-06 10:44:44,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039328634] [2025-02-06 10:44:44,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:44,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:44,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039328634] [2025-02-06 10:44:44,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039328634] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414100934] [2025-02-06 10:44:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,361 INFO L87 Difference]: Start difference. First operand 3398 states and 4292 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,382 INFO L93 Difference]: Finished difference Result 5641 states and 7046 transitions. [2025-02-06 10:44:44,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,382 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-02-06 10:44:44,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,392 INFO L225 Difference]: With dead ends: 5641 [2025-02-06 10:44:44,392 INFO L226 Difference]: Without dead ends: 5641 [2025-02-06 10:44:44,393 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-02-06 10:44:44,393 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 23 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5641 states. [2025-02-06 10:44:44,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5641 to 5126. [2025-02-06 10:44:44,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5126 states, 5125 states have (on average 1.2245853658536585) internal successors, (6276), 5125 states have internal predecessors, (6276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5126 states to 5126 states and 6276 transitions. [2025-02-06 10:44:44,460 INFO L78 Accepts]: Start accepts. Automaton has 5126 states and 6276 transitions. Word has length 24 [2025-02-06 10:44:44,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,460 INFO L471 AbstractCegarLoop]: Abstraction has 5126 states and 6276 transitions. [2025-02-06 10:44:44,460 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-02-06 10:44:44,460 INFO L276 IsEmpty]: Start isEmpty. Operand 5126 states and 6276 transitions. [2025-02-06 10:44:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-06 10:44:44,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,464 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-02-06 10:44:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 10:44:44,464 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1572244381, now seen corresponding path program 1 times [2025-02-06 10:44:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668402607] [2025-02-06 10:44:44,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 10:44:44,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 10:44:44,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668402607] [2025-02-06 10:44:44,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668402607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272620140] [2025-02-06 10:44:44,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,481 INFO L87 Difference]: Start difference. First operand 5126 states and 6276 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,507 INFO L93 Difference]: Finished difference Result 6537 states and 7686 transitions. [2025-02-06 10:44:44,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,507 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-02-06 10:44:44,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,514 INFO L225 Difference]: With dead ends: 6537 [2025-02-06 10:44:44,514 INFO L226 Difference]: Without dead ends: 6537 [2025-02-06 10:44:44,515 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-02-06 10:44:44,515 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,515 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6537 states. [2025-02-06 10:44:44,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6537 to 6534. [2025-02-06 10:44:44,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6534 states, 6533 states have (on average 1.1761824582886882) internal successors, (7684), 6533 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6534 states to 6534 states and 7684 transitions. [2025-02-06 10:44:44,606 INFO L78 Accepts]: Start accepts. Automaton has 6534 states and 7684 transitions. Word has length 24 [2025-02-06 10:44:44,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,607 INFO L471 AbstractCegarLoop]: Abstraction has 6534 states and 7684 transitions. [2025-02-06 10:44:44,607 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-02-06 10:44:44,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6534 states and 7684 transitions. [2025-02-06 10:44:44,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:44,612 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,612 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-02-06 10:44:44,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 10:44:44,612 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,613 INFO L85 PathProgramCache]: Analyzing trace with hash 2001303378, now seen corresponding path program 1 times [2025-02-06 10:44:44,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623543793] [2025-02-06 10:44:44,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:44,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:44,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623543793] [2025-02-06 10:44:44,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623543793] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768757771] [2025-02-06 10:44:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,627 INFO L87 Difference]: Start difference. First operand 6534 states and 7684 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,652 INFO L93 Difference]: Finished difference Result 6665 states and 7686 transitions. [2025-02-06 10:44:44,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,652 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-02-06 10:44:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,659 INFO L225 Difference]: With dead ends: 6665 [2025-02-06 10:44:44,659 INFO L226 Difference]: Without dead ends: 6665 [2025-02-06 10:44:44,659 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-02-06 10:44:44,659 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 119 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2025-02-06 10:44:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6662. [2025-02-06 10:44:44,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6662 states, 6661 states have (on average 1.1535805434619426) internal successors, (7684), 6661 states have internal predecessors, (7684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6662 states to 6662 states and 7684 transitions. [2025-02-06 10:44:44,784 INFO L78 Accepts]: Start accepts. Automaton has 6662 states and 7684 transitions. Word has length 25 [2025-02-06 10:44:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,784 INFO L471 AbstractCegarLoop]: Abstraction has 6662 states and 7684 transitions. [2025-02-06 10:44:44,784 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-02-06 10:44:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 6662 states and 7684 transitions. [2025-02-06 10:44:44,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:44,788 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,788 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-02-06 10:44:44,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 10:44:44,788 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1495744753, now seen corresponding path program 1 times [2025-02-06 10:44:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106700220] [2025-02-06 10:44:44,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:44,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:44,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:44,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:44,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106700220] [2025-02-06 10:44:44,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106700220] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:44,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:44,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:44,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720394825] [2025-02-06 10:44:44,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:44,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:44,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:44,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:44,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:44,804 INFO L87 Difference]: Start difference. First operand 6662 states and 7684 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:44,832 INFO L93 Difference]: Finished difference Result 10758 states and 12036 transitions. [2025-02-06 10:44:44,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:44,833 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-02-06 10:44:44,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:44,844 INFO L225 Difference]: With dead ends: 10758 [2025-02-06 10:44:44,844 INFO L226 Difference]: Without dead ends: 10758 [2025-02-06 10:44:44,844 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-02-06 10:44:44,845 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 18 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:44,845 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10758 states. [2025-02-06 10:44:44,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10758 to 10246. [2025-02-06 10:44:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10246 states, 10245 states have (on average 1.1248413860419717) internal successors, (11524), 10245 states have internal predecessors, (11524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10246 states to 10246 states and 11524 transitions. [2025-02-06 10:44:44,982 INFO L78 Accepts]: Start accepts. Automaton has 10246 states and 11524 transitions. Word has length 25 [2025-02-06 10:44:44,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:44,982 INFO L471 AbstractCegarLoop]: Abstraction has 10246 states and 11524 transitions. [2025-02-06 10:44:44,982 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-02-06 10:44:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 10246 states and 11524 transitions. [2025-02-06 10:44:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-06 10:44:44,993 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:44:44,993 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-02-06 10:44:44,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 10:44:44,993 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-06 10:44:44,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:44:44,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1202341746, now seen corresponding path program 1 times [2025-02-06 10:44:44,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:44:44,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061611796] [2025-02-06 10:44:44,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:44:44,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:44:44,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 10:44:44,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 10:44:44,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:44:44,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:44:45,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:44:45,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:44:45,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061611796] [2025-02-06 10:44:45,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061611796] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:44:45,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:44:45,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:44:45,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440963401] [2025-02-06 10:44:45,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:44:45,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:44:45,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:44:45,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:44:45,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:45,013 INFO L87 Difference]: Start difference. First operand 10246 states and 11524 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:45,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:44:45,047 INFO L93 Difference]: Finished difference Result 12803 states and 13570 transitions. [2025-02-06 10:44:45,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:44:45,047 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-02-06 10:44:45,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:44:45,047 INFO L225 Difference]: With dead ends: 12803 [2025-02-06 10:44:45,047 INFO L226 Difference]: Without dead ends: 0 [2025-02-06 10:44:45,047 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:44:45,048 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:44:45,048 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:44:45,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-06 10:44:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-06 10:44:45,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:44:45,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-06 10:44:45,048 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2025-02-06 10:44:45,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:44:45,048 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-06 10:44:45,049 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-02-06 10:44:45,049 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-06 10:44:45,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-06 10:44:45,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-02-06 10:44:45,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-02-06 10:44:45,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 10:44:45,053 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:44:45,054 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 10:44:45,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 10:44:45 BoogieIcfgContainer [2025-02-06 10:44:45,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 10:44:45,057 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 10:44:45,057 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 10:44:45,057 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 10:44:45,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:44:42" (3/4) ... [2025-02-06 10:44:45,059 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 10:44:45,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-06 10:44:45,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-02-06 10:44:45,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 10:44:45,065 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 10:44:45,119 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 10:44:45,120 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 10:44:45,120 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 10:44:45,120 INFO L158 Benchmark]: Toolchain (without parser) took 3004.08ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 132.9MB in the beginning and 99.5MB in the end (delta: 33.4MB). Peak memory consumption was 147.9MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,120 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:44:45,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.02ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 121.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,120 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.32ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 10:44:45,121 INFO L158 Benchmark]: Boogie Preprocessor took 18.67ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 119.0MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,121 INFO L158 Benchmark]: IcfgBuilder took 294.46ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 104.3MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,121 INFO L158 Benchmark]: TraceAbstraction took 2412.23ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 103.8MB in the beginning and 106.3MB in the end (delta: -2.5MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,121 INFO L158 Benchmark]: Witness Printer took 62.98ms. Allocated memory is still 285.2MB. Free memory was 106.3MB in the beginning and 99.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 10:44:45,122 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 226.5MB. Free memory is still 140.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.02ms. Allocated memory is still 167.8MB. Free memory was 132.9MB in the beginning and 121.4MB in the end (delta: 11.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.32ms. Allocated memory is still 167.8MB. Free memory was 121.4MB in the beginning and 120.0MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.67ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 119.0MB in the end (delta: 1.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 294.46ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 104.3MB in the end (delta: 14.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2412.23ms. Allocated memory was 167.8MB in the beginning and 285.2MB in the end (delta: 117.4MB). Free memory was 103.8MB in the beginning and 106.3MB in the end (delta: -2.5MB). Peak memory consumption was 114.3MB. Max. memory is 16.1GB. * Witness Printer took 62.98ms. Allocated memory is still 285.2MB. Free memory was 106.3MB in the beginning and 99.5MB in the end (delta: 6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 40 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1041 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1041 mSDsluCounter, 3390 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1303 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 2087 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10246occurred in iteration=27, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 2098 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 561 NumberOfCodeBlocks, 561 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 1099 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 10:44:45,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE