./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_6.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_6.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 08:02:36,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:02:36,217 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 08:02:36,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:02:36,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:02:36,252 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:02:36,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:02:36,253 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:02:36,254 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:02:36,254 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:02:36,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:02:36,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:02:36,255 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:02:36,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 08:02:36,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:02:36,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:02:36,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:02:36,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:02:36,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:02:36,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:02:36,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:02:36,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:02:36,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2025-03-04 08:02:36,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:02:36,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:02:36,501 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:02:36,502 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:02:36,502 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:02:36,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2025-03-04 08:02:37,643 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4348f429/027476b4580747dcb819f6a8f55b33b1/FLAG4a30c2030 [2025-03-04 08:02:37,845 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:02:37,847 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2025-03-04 08:02:37,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4348f429/027476b4580747dcb819f6a8f55b33b1/FLAG4a30c2030 [2025-03-04 08:02:38,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4348f429/027476b4580747dcb819f6a8f55b33b1 [2025-03-04 08:02:38,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:02:38,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:02:38,224 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:02:38,224 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:02:38,227 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:02:38,228 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74781be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38, skipping insertion in model container [2025-03-04 08:02:38,229 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,241 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:02:38,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:02:38,350 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:02:38,365 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:02:38,374 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:02:38,375 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38 WrapperNode [2025-03-04 08:02:38,375 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:02:38,376 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:02:38,376 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:02:38,376 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:02:38,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,397 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2025-03-04 08:02:38,398 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:02:38,398 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:02:38,398 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:02:38,398 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:02:38,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,412 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 08:02:38,412 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,412 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,417 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,418 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:02:38,419 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:02:38,419 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:02:38,420 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:02:38,420 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (1/1) ... [2025-03-04 08:02:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:02:38,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:02:38,443 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 08:02:38,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 08:02:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 08:02:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:02:38,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:02:38,463 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 08:02:38,504 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:02:38,505 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:02:38,670 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-04 08:02:38,670 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:02:38,680 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:02:38,680 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:02:38,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:02:38 BoogieIcfgContainer [2025-03-04 08:02:38,681 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:02:38,683 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:02:38,684 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:02:38,687 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:02:38,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:02:38" (1/3) ... [2025-03-04 08:02:38,688 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f481fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:02:38, skipping insertion in model container [2025-03-04 08:02:38,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:02:38" (2/3) ... [2025-03-04 08:02:38,689 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f481fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:02:38, skipping insertion in model container [2025-03-04 08:02:38,689 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:02:38" (3/3) ... [2025-03-04 08:02:38,690 INFO L128 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2025-03-04 08:02:38,703 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:02:38,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_locks_6.c that has 1 procedures, 31 locations, 1 initial locations, 1 loop locations, and 2 error locations. [2025-03-04 08:02:38,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:02:38,749 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;@336a410d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:02:38,750 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 08:02:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 08:02:38,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:38,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 08:02:38,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:38,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:38,763 INFO L85 PathProgramCache]: Analyzing trace with hash 96351070, now seen corresponding path program 1 times [2025-03-04 08:02:38,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:38,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220921119] [2025-03-04 08:02:38,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:38,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:38,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 08:02:38,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 08:02:38,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:38,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:38,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:38,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220921119] [2025-03-04 08:02:38,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220921119] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:38,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:38,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:02:38,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368485760] [2025-03-04 08:02:38,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:38,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 08:02:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:38,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 08:02:38,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 08:02:38,905 INFO L87 Difference]: Start difference. First operand has 31 states, 28 states have (on average 1.7857142857142858) internal successors, (50), 30 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:38,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:38,915 INFO L93 Difference]: Finished difference Result 30 states and 47 transitions. [2025-03-04 08:02:38,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 08:02:38,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 08:02:38,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:38,920 INFO L225 Difference]: With dead ends: 30 [2025-03-04 08:02:38,920 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 08:02:38,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 08:02:38,923 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:38,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 08:02:38,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-04 08:02:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.7307692307692308) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:38,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 45 transitions. [2025-03-04 08:02:38,943 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 45 transitions. Word has length 5 [2025-03-04 08:02:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:38,944 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 45 transitions. [2025-03-04 08:02:38,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:38,944 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 45 transitions. [2025-03-04 08:02:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 08:02:38,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:38,944 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 08:02:38,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:02:38,944 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:38,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:38,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1308058922, now seen corresponding path program 1 times [2025-03-04 08:02:38,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:38,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535328639] [2025-03-04 08:02:38,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:38,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:38,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 08:02:38,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 08:02:38,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:38,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535328639] [2025-03-04 08:02:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535328639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:38,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:38,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:02:38,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573665408] [2025-03-04 08:02:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:38,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:38,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:38,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:38,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:38,990 INFO L87 Difference]: Start difference. First operand 28 states and 45 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:38,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:38,996 INFO L93 Difference]: Finished difference Result 27 states and 44 transitions. [2025-03-04 08:02:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:38,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 08:02:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:38,997 INFO L225 Difference]: With dead ends: 27 [2025-03-04 08:02:38,998 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 08:02:38,998 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:38,998 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:38,999 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 44 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 08:02:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 08:02:39,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.75) internal successors, (42), 24 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 42 transitions. [2025-03-04 08:02:39,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 42 transitions. Word has length 6 [2025-03-04 08:02:39,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,002 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 42 transitions. [2025-03-04 08:02:39,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,002 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 42 transitions. [2025-03-04 08:02:39,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 08:02:39,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,002 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:02:39,002 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,003 INFO L85 PathProgramCache]: Analyzing trace with hash 1987219413, now seen corresponding path program 1 times [2025-03-04 08:02:39,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553490293] [2025-03-04 08:02:39,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:02:39,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:02:39,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553490293] [2025-03-04 08:02:39,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553490293] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267771253] [2025-03-04 08:02:39,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,051 INFO L87 Difference]: Start difference. First operand 25 states and 42 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,077 INFO L93 Difference]: Finished difference Result 47 states and 79 transitions. [2025-03-04 08:02:39,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 08:02:39,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,078 INFO L225 Difference]: With dead ends: 47 [2025-03-04 08:02:39,078 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 08:02:39,079 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,079 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 82 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 08:02:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2025-03-04 08:02:39,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 55 transitions. [2025-03-04 08:02:39,083 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 55 transitions. Word has length 14 [2025-03-04 08:02:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,083 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 55 transitions. [2025-03-04 08:02:39,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 55 transitions. [2025-03-04 08:02:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-04 08:02:39,083 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,083 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 08:02:39,084 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1790705908, now seen corresponding path program 1 times [2025-03-04 08:02:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-04 08:02:39,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-04 08:02:39,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-04 08:02:39,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880528387] [2025-03-04 08:02:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880528387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965683976] [2025-03-04 08:02:39,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,137 INFO L87 Difference]: Start difference. First operand 32 states and 55 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,148 INFO L93 Difference]: Finished difference Result 47 states and 77 transitions. [2025-03-04 08:02:39,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-04 08:02:39,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,150 INFO L225 Difference]: With dead ends: 47 [2025-03-04 08:02:39,150 INFO L226 Difference]: Without dead ends: 47 [2025-03-04 08:02:39,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,150 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 29 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-03-04 08:02:39,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2025-03-04 08:02:39,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.744186046511628) internal successors, (75), 43 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 75 transitions. [2025-03-04 08:02:39,156 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 75 transitions. Word has length 14 [2025-03-04 08:02:39,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,156 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 75 transitions. [2025-03-04 08:02:39,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,157 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 75 transitions. [2025-03-04 08:02:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 08:02:39,158 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,158 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 08:02:39,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1475095765, now seen corresponding path program 1 times [2025-03-04 08:02:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-04 08:02:39,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 08:02:39,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 08:02:39,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911687258] [2025-03-04 08:02:39,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911687258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446556986] [2025-03-04 08:02:39,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,203 INFO L87 Difference]: Start difference. First operand 44 states and 75 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,217 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2025-03-04 08:02:39,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 08:02:39,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,218 INFO L225 Difference]: With dead ends: 50 [2025-03-04 08:02:39,218 INFO L226 Difference]: Without dead ends: 50 [2025-03-04 08:02:39,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,219 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 31 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 99 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-04 08:02:39,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2025-03-04 08:02:39,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.673913043478261) internal successors, (77), 46 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 77 transitions. [2025-03-04 08:02:39,222 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 77 transitions. Word has length 15 [2025-03-04 08:02:39,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,222 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 77 transitions. [2025-03-04 08:02:39,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,222 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 77 transitions. [2025-03-04 08:02:39,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 08:02:39,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,222 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 08:02:39,223 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,223 INFO L85 PathProgramCache]: Analyzing trace with hash -321855594, now seen corresponding path program 1 times [2025-03-04 08:02:39,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42967892] [2025-03-04 08:02:39,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 08:02:39,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 08:02:39,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42967892] [2025-03-04 08:02:39,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42967892] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806025963] [2025-03-04 08:02:39,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,271 INFO L87 Difference]: Start difference. First operand 47 states and 77 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,286 INFO L93 Difference]: Finished difference Result 85 states and 140 transitions. [2025-03-04 08:02:39,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 08:02:39,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,287 INFO L225 Difference]: With dead ends: 85 [2025-03-04 08:02:39,287 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 08:02:39,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,288 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 26 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 80 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 08:02:39,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 62. [2025-03-04 08:02:39,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.6721311475409837) internal successors, (102), 61 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 102 transitions. [2025-03-04 08:02:39,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 102 transitions. Word has length 15 [2025-03-04 08:02:39,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,294 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 102 transitions. [2025-03-04 08:02:39,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 102 transitions. [2025-03-04 08:02:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-04 08:02:39,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,295 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 08:02:39,295 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,295 INFO L85 PathProgramCache]: Analyzing trace with hash -518369099, now seen corresponding path program 1 times [2025-03-04 08:02:39,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-03-04 08:02:39,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-04 08:02:39,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-04 08:02:39,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117865313] [2025-03-04 08:02:39,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117865313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56972468] [2025-03-04 08:02:39,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,319 INFO L87 Difference]: Start difference. First operand 62 states and 102 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,333 INFO L93 Difference]: Finished difference Result 87 states and 138 transitions. [2025-03-04 08:02:39,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-04 08:02:39,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,334 INFO L225 Difference]: With dead ends: 87 [2025-03-04 08:02:39,334 INFO L226 Difference]: Without dead ends: 87 [2025-03-04 08:02:39,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,336 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-04 08:02:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-03-04 08:02:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.6385542168674698) internal successors, (136), 83 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 136 transitions. [2025-03-04 08:02:39,341 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 136 transitions. Word has length 15 [2025-03-04 08:02:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,341 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 136 transitions. [2025-03-04 08:02:39,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,342 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 136 transitions. [2025-03-04 08:02:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:02:39,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 08:02:39,343 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1386759443, now seen corresponding path program 1 times [2025-03-04 08:02:39,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-04 08:02:39,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:02:39,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:02:39,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039125414] [2025-03-04 08:02:39,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039125414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109311763] [2025-03-04 08:02:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,384 INFO L87 Difference]: Start difference. First operand 84 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,398 INFO L93 Difference]: Finished difference Result 89 states and 138 transitions. [2025-03-04 08:02:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:02:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,399 INFO L225 Difference]: With dead ends: 89 [2025-03-04 08:02:39,399 INFO L226 Difference]: Without dead ends: 89 [2025-03-04 08:02:39,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,400 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-04 08:02:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2025-03-04 08:02:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.6) internal successors, (136), 85 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 136 transitions. [2025-03-04 08:02:39,409 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 136 transitions. Word has length 16 [2025-03-04 08:02:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,409 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 136 transitions. [2025-03-04 08:02:39,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 136 transitions. [2025-03-04 08:02:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:02:39,412 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,412 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 08:02:39,412 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1111256494, now seen corresponding path program 1 times [2025-03-04 08:02:39,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300993855] [2025-03-04 08:02:39,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:02:39,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:02:39,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300993855] [2025-03-04 08:02:39,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300993855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340579442] [2025-03-04 08:02:39,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,452 INFO L87 Difference]: Start difference. First operand 86 states and 136 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,463 INFO L93 Difference]: Finished difference Result 153 states and 242 transitions. [2025-03-04 08:02:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:02:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,465 INFO L225 Difference]: With dead ends: 153 [2025-03-04 08:02:39,465 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 08:02:39,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,465 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 08:02:39,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 118. [2025-03-04 08:02:39,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.5726495726495726) internal successors, (184), 117 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 184 transitions. [2025-03-04 08:02:39,470 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 184 transitions. Word has length 16 [2025-03-04 08:02:39,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 184 transitions. [2025-03-04 08:02:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 184 transitions. [2025-03-04 08:02:39,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:02:39,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,471 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 08:02:39,472 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,472 INFO L85 PathProgramCache]: Analyzing trace with hash 914742989, now seen corresponding path program 1 times [2025-03-04 08:02:39,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-03-04 08:02:39,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:02:39,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:02:39,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47129020] [2025-03-04 08:02:39,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47129020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638405408] [2025-03-04 08:02:39,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,507 INFO L87 Difference]: Start difference. First operand 118 states and 184 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,520 INFO L93 Difference]: Finished difference Result 161 states and 242 transitions. [2025-03-04 08:02:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:02:39,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,521 INFO L225 Difference]: With dead ends: 161 [2025-03-04 08:02:39,521 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 08:02:39,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,521 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 08:02:39,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2025-03-04 08:02:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.5286624203821657) internal successors, (240), 157 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 240 transitions. [2025-03-04 08:02:39,530 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 240 transitions. Word has length 16 [2025-03-04 08:02:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,530 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 240 transitions. [2025-03-04 08:02:39,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 240 transitions. [2025-03-04 08:02:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 08:02:39,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 08:02:39,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,534 INFO L85 PathProgramCache]: Analyzing trace with hash 90035598, now seen corresponding path program 1 times [2025-03-04 08:02:39,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862830757] [2025-03-04 08:02:39,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 08:02:39,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 08:02:39,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862830757] [2025-03-04 08:02:39,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862830757] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540012713] [2025-03-04 08:02:39,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,561 INFO L87 Difference]: Start difference. First operand 158 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,569 INFO L93 Difference]: Finished difference Result 165 states and 242 transitions. [2025-03-04 08:02:39,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 08:02:39,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,570 INFO L225 Difference]: With dead ends: 165 [2025-03-04 08:02:39,570 INFO L226 Difference]: Without dead ends: 165 [2025-03-04 08:02:39,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,573 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 91 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-04 08:02:39,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2025-03-04 08:02:39,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 161 states have (on average 1.4906832298136645) internal successors, (240), 161 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 240 transitions. [2025-03-04 08:02:39,584 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 240 transitions. Word has length 17 [2025-03-04 08:02:39,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,584 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 240 transitions. [2025-03-04 08:02:39,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,584 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 240 transitions. [2025-03-04 08:02:39,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 08:02:39,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,589 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 08:02:39,589 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1706915761, now seen corresponding path program 1 times [2025-03-04 08:02:39,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999037021] [2025-03-04 08:02:39,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 08:02:39,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 08:02:39,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999037021] [2025-03-04 08:02:39,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999037021] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533022367] [2025-03-04 08:02:39,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,619 INFO L87 Difference]: Start difference. First operand 162 states and 240 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,628 INFO L93 Difference]: Finished difference Result 281 states and 414 transitions. [2025-03-04 08:02:39,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 08:02:39,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,629 INFO L225 Difference]: With dead ends: 281 [2025-03-04 08:02:39,629 INFO L226 Difference]: Without dead ends: 281 [2025-03-04 08:02:39,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,630 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 20 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2025-03-04 08:02:39,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 230. [2025-03-04 08:02:39,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 229 states have (on average 1.4497816593886463) internal successors, (332), 229 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 332 transitions. [2025-03-04 08:02:39,640 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 332 transitions. Word has length 17 [2025-03-04 08:02:39,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,640 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 332 transitions. [2025-03-04 08:02:39,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,640 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 332 transitions. [2025-03-04 08:02:39,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-04 08:02:39,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 08:02:39,641 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1903429266, now seen corresponding path program 1 times [2025-03-04 08:02:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551579992] [2025-03-04 08:02:39,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 08:02:39,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 08:02:39,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551579992] [2025-03-04 08:02:39,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551579992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649435430] [2025-03-04 08:02:39,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,662 INFO L87 Difference]: Start difference. First operand 230 states and 332 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,671 INFO L93 Difference]: Finished difference Result 305 states and 422 transitions. [2025-03-04 08:02:39,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-04 08:02:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,672 INFO L225 Difference]: With dead ends: 305 [2025-03-04 08:02:39,672 INFO L226 Difference]: Without dead ends: 305 [2025-03-04 08:02:39,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,673 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 26 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 92 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-03-04 08:02:39,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2025-03-04 08:02:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.3953488372093024) internal successors, (420), 301 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 420 transitions. [2025-03-04 08:02:39,678 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 420 transitions. Word has length 17 [2025-03-04 08:02:39,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,678 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 420 transitions. [2025-03-04 08:02:39,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,679 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 420 transitions. [2025-03-04 08:02:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 08:02:39,679 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,679 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 08:02:39,680 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1373965114, now seen corresponding path program 1 times [2025-03-04 08:02:39,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838075902] [2025-03-04 08:02:39,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 08:02:39,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 08:02:39,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838075902] [2025-03-04 08:02:39,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838075902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143711093] [2025-03-04 08:02:39,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,696 INFO L87 Difference]: Start difference. First operand 302 states and 420 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,705 INFO L93 Difference]: Finished difference Result 313 states and 422 transitions. [2025-03-04 08:02:39,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 08:02:39,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,706 INFO L225 Difference]: With dead ends: 313 [2025-03-04 08:02:39,706 INFO L226 Difference]: Without dead ends: 313 [2025-03-04 08:02:39,706 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,707 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,707 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 87 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2025-03-04 08:02:39,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 310. [2025-03-04 08:02:39,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.3592233009708738) internal successors, (420), 309 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 420 transitions. [2025-03-04 08:02:39,712 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 420 transitions. Word has length 18 [2025-03-04 08:02:39,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,713 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 420 transitions. [2025-03-04 08:02:39,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 420 transitions. [2025-03-04 08:02:39,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 08:02:39,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,713 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 08:02:39,714 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,714 INFO L85 PathProgramCache]: Analyzing trace with hash 1124050823, now seen corresponding path program 1 times [2025-03-04 08:02:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114365823] [2025-03-04 08:02:39,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 08:02:39,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 08:02:39,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114365823] [2025-03-04 08:02:39,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114365823] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537722529] [2025-03-04 08:02:39,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,745 INFO L87 Difference]: Start difference. First operand 310 states and 420 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,755 INFO L93 Difference]: Finished difference Result 521 states and 694 transitions. [2025-03-04 08:02:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 08:02:39,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,757 INFO L225 Difference]: With dead ends: 521 [2025-03-04 08:02:39,757 INFO L226 Difference]: Without dead ends: 521 [2025-03-04 08:02:39,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,757 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 74 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2025-03-04 08:02:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 454. [2025-03-04 08:02:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 1.315673289183223) internal successors, (596), 453 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 596 transitions. [2025-03-04 08:02:39,768 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 596 transitions. Word has length 18 [2025-03-04 08:02:39,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,769 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 596 transitions. [2025-03-04 08:02:39,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,770 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 596 transitions. [2025-03-04 08:02:39,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-04 08:02:39,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,771 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 08:02:39,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,771 INFO L85 PathProgramCache]: Analyzing trace with hash 927537318, now seen corresponding path program 1 times [2025-03-04 08:02:39,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119378554] [2025-03-04 08:02:39,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 08:02:39,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 08:02:39,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119378554] [2025-03-04 08:02:39,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119378554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679557620] [2025-03-04 08:02:39,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,792 INFO L87 Difference]: Start difference. First operand 454 states and 596 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,803 INFO L93 Difference]: Finished difference Result 585 states and 726 transitions. [2025-03-04 08:02:39,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-04 08:02:39,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,805 INFO L225 Difference]: With dead ends: 585 [2025-03-04 08:02:39,805 INFO L226 Difference]: Without dead ends: 585 [2025-03-04 08:02:39,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,806 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 93 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-03-04 08:02:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 582. [2025-03-04 08:02:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 581 states have (on average 1.2461273666092942) internal successors, (724), 581 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 724 transitions. [2025-03-04 08:02:39,815 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 724 transitions. Word has length 18 [2025-03-04 08:02:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,815 INFO L471 AbstractCegarLoop]: Abstraction has 582 states and 724 transitions. [2025-03-04 08:02:39,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 724 transitions. [2025-03-04 08:02:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 08:02:39,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,816 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 08:02:39,817 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,817 INFO L85 PathProgramCache]: Analyzing trace with hash 486646343, now seen corresponding path program 1 times [2025-03-04 08:02:39,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627633230] [2025-03-04 08:02:39,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 08:02:39,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 08:02:39,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627633230] [2025-03-04 08:02:39,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627633230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180747993] [2025-03-04 08:02:39,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,832 INFO L87 Difference]: Start difference. First operand 582 states and 724 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,841 INFO L93 Difference]: Finished difference Result 601 states and 726 transitions. [2025-03-04 08:02:39,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 08:02:39,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,843 INFO L225 Difference]: With dead ends: 601 [2025-03-04 08:02:39,843 INFO L226 Difference]: Without dead ends: 601 [2025-03-04 08:02:39,843 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,844 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-04 08:02:39,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 598. [2025-03-04 08:02:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.2127303182579565) internal successors, (724), 597 states have internal predecessors, (724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 724 transitions. [2025-03-04 08:02:39,854 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 724 transitions. Word has length 19 [2025-03-04 08:02:39,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,854 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 724 transitions. [2025-03-04 08:02:39,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,854 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 724 transitions. [2025-03-04 08:02:39,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 08:02:39,855 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,855 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 08:02:39,855 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,856 INFO L85 PathProgramCache]: Analyzing trace with hash -1310305016, now seen corresponding path program 1 times [2025-03-04 08:02:39,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250291620] [2025-03-04 08:02:39,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 08:02:39,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 08:02:39,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250291620] [2025-03-04 08:02:39,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250291620] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869099025] [2025-03-04 08:02:39,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,890 INFO L87 Difference]: Start difference. First operand 598 states and 724 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,901 INFO L93 Difference]: Finished difference Result 966 states and 1124 transitions. [2025-03-04 08:02:39,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,901 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 08:02:39,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,903 INFO L225 Difference]: With dead ends: 966 [2025-03-04 08:02:39,903 INFO L226 Difference]: Without dead ends: 966 [2025-03-04 08:02:39,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,904 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2025-03-04 08:02:39,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 902. [2025-03-04 08:02:39,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 901 states have (on average 1.1764705882352942) internal successors, (1060), 901 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1060 transitions. [2025-03-04 08:02:39,918 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1060 transitions. Word has length 19 [2025-03-04 08:02:39,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,918 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1060 transitions. [2025-03-04 08:02:39,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,919 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1060 transitions. [2025-03-04 08:02:39,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-04 08:02:39,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:02:39,920 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 08:02:39,921 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-03-04 08:02:39,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:02:39,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1506818521, now seen corresponding path program 1 times [2025-03-04 08:02:39,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:02:39,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325637478] [2025-03-04 08:02:39,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:02:39,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:02:39,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 08:02:39,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 08:02:39,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:02:39,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:02:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:02:39,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:02:39,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325637478] [2025-03-04 08:02:39,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325637478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:02:39,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:02:39,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:02:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852166761] [2025-03-04 08:02:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:02:39,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:02:39,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:02:39,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:02:39,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:02:39,945 INFO L87 Difference]: Start difference. First operand 902 states and 1060 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:02:39,958 INFO L93 Difference]: Finished difference Result 1123 states and 1218 transitions. [2025-03-04 08:02:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:02:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-03-04 08:02:39,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:02:39,959 INFO L225 Difference]: With dead ends: 1123 [2025-03-04 08:02:39,959 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 08:02:39,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-03-04 08:02:39,960 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:02:39,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:02:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 08:02:39,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 08:02:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 08:02:39,960 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2025-03-04 08:02:39,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:02:39,960 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 08:02:39,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:02:39,960 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 08:02:39,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 08:02:39,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2025-03-04 08:02:39,964 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2025-03-04 08:02:39,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 08:02:39,968 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:02:39,970 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 08:02:39,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 08:02:39 BoogieIcfgContainer [2025-03-04 08:02:39,973 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 08:02:39,973 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 08:02:39,973 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 08:02:39,973 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 08:02:39,974 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:02:38" (3/4) ... [2025-03-04 08:02:39,975 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 08:02:39,983 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-04 08:02:39,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-03-04 08:02:39,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 08:02:39,984 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 08:02:40,034 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 08:02:40,035 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 08:02:40,035 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 08:02:40,035 INFO L158 Benchmark]: Toolchain (without parser) took 1811.92ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 90.0MB in the end (delta: 23.8MB). Peak memory consumption was 17.5MB. Max. memory is 16.1GB. [2025-03-04 08:02:40,035 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 150.85ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.93ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: Boogie Preprocessor took 20.51ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: IcfgBuilder took 262.13ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 87.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: TraceAbstraction took 1290.10ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 95.5MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:40,036 INFO L158 Benchmark]: Witness Printer took 61.59ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.0MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 08:02:40,037 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.27ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 150.85ms. Allocated memory is still 142.6MB. Free memory was 113.8MB in the beginning and 102.5MB in the end (delta: 11.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.93ms. Allocated memory is still 142.6MB. Free memory was 102.5MB in the beginning and 101.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.51ms. Allocated memory is still 142.6MB. Free memory was 101.3MB in the beginning and 100.1MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 262.13ms. Allocated memory is still 142.6MB. Free memory was 100.1MB in the beginning and 87.1MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1290.10ms. Allocated memory is still 142.6MB. Free memory was 86.5MB in the beginning and 95.5MB in the end (delta: -9.0MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 61.59ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.0MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 468 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 1551 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 571 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 92 IncrementalHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 980 mSDtfsCounter, 92 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=902occurred in iteration=18, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 285 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 275 ConstructedInterpolants, 0 QuantifiedInterpolants, 529 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 08:02:40,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE