./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 528fbc32d9aa1d8a4eedfd9ab07830e3af97eea6ef37fe4df10e8aa3c9d21936 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:49:15,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:49:15,360 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2025-02-08 05:49:15,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:49:15,363 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:49:15,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:49:15,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:49:15,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:49:15,378 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 05:49:15,378 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 05:49:15,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:49:15,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:49:15,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:49:15,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:49:15,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:49:15,380 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:49:15,381 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:15,381 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:49:15,381 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:49:15,382 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) 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 -> 528fbc32d9aa1d8a4eedfd9ab07830e3af97eea6ef37fe4df10e8aa3c9d21936 [2025-02-08 05:49:15,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:49:15,592 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:49:15,594 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:49:15,595 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:49:15,595 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:49:15,596 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2025-02-08 05:49:16,731 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e41245234/e779faeddd4749c8ab700179760ef467/FLAG832542b12 [2025-02-08 05:49:17,004 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:49:17,005 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_length_check-1.i [2025-02-08 05:49:17,017 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e41245234/e779faeddd4749c8ab700179760ef467/FLAG832542b12 [2025-02-08 05:49:17,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e41245234/e779faeddd4749c8ab700179760ef467 [2025-02-08 05:49:17,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:49:17,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:49:17,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:17,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:49:17,308 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:49:17,309 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47611e70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17, skipping insertion in model container [2025-02-08 05:49:17,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:49:17,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:17,565 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:49:17,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:49:17,605 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:49:17,605 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17 WrapperNode [2025-02-08 05:49:17,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:49:17,607 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:17,607 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:49:17,607 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:49:17,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,636 INFO L138 Inliner]: procedures = 125, calls = 16, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 81 [2025-02-08 05:49:17,638 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:49:17,638 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:49:17,638 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:49:17,638 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:49:17,644 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,657 INFO L175 MemorySlicer]: Split 5 memory accesses to 2 slices as follows [2, 3]. 60 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-02-08 05:49:17,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:49:17,667 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:49:17,667 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:49:17,667 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:49:17,668 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (1/1) ... [2025-02-08 05:49:17,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:49:17,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:17,692 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:49:17,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 05:49:17,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 05:49:17,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:49:17,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:49:17,799 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:49:17,801 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L579: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1; [2025-02-08 05:49:17,896 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L613-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 05:49:17,902 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2025-02-08 05:49:17,902 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:49:17,908 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:49:17,908 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:49:17,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:17 BoogieIcfgContainer [2025-02-08 05:49:17,909 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:49:17,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:49:17,911 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:49:17,914 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:49:17,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:49:17" (1/3) ... [2025-02-08 05:49:17,914 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3732e6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:17, skipping insertion in model container [2025-02-08 05:49:17,914 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:49:17" (2/3) ... [2025-02-08 05:49:17,915 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3732e6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:49:17, skipping insertion in model container [2025-02-08 05:49:17,915 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:49:17" (3/3) ... [2025-02-08 05:49:17,915 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_length_check-1.i [2025-02-08 05:49:17,926 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:49:17,927 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_length_check-1.i that has 1 procedures, 17 locations, 1 initial locations, 4 loop locations, and 2 error locations. [2025-02-08 05:49:17,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:49:17,966 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;@56cae9a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:49:17,966 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-08 05:49:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-02-08 05:49:17,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:17,972 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:17,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:17,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -65853841, now seen corresponding path program 1 times [2025-02-08 05:49:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:17,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906673436] [2025-02-08 05:49:17,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:17,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-08 05:49:18,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-08 05:49:18,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906673436] [2025-02-08 05:49:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906673436] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:49:18,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424936333] [2025-02-08 05:49:18,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-08 05:49:18,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-08 05:49:18,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:49:18,088 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.6923076923076923) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,093 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2025-02-08 05:49:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-08 05:49:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2025-02-08 05:49:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,100 INFO L225 Difference]: With dead ends: 17 [2025-02-08 05:49:18,100 INFO L226 Difference]: Without dead ends: 13 [2025-02-08 05:49:18,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-08 05:49:18,103 INFO L435 NwaCegarLoop]: 21 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, 21 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-08 05:49:18,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-08 05:49:18,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-08 05:49:18,120 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 8 [2025-02-08 05:49:18,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,120 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-08 05:49:18,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-08 05:49:18,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 05:49:18,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,121 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:49:18,121 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,121 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,121 INFO L85 PathProgramCache]: Analyzing trace with hash 1064141227, now seen corresponding path program 1 times [2025-02-08 05:49:18,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039681426] [2025-02-08 05:49:18,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 05:49:18,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 05:49:18,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:18,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039681426] [2025-02-08 05:49:18,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039681426] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:49:18,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616083273] [2025-02-08 05:49:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 05:49:18,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 05:49:18,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 05:49:18,235 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,266 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2025-02-08 05:49:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:49:18,266 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-02-08 05:49:18,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,266 INFO L225 Difference]: With dead ends: 22 [2025-02-08 05:49:18,266 INFO L226 Difference]: Without dead ends: 22 [2025-02-08 05:49:18,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:18,267 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-08 05:49:18,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 15. [2025-02-08 05:49:18,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2025-02-08 05:49:18,274 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2025-02-08 05:49:18,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,274 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2025-02-08 05:49:18,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,274 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2025-02-08 05:49:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-02-08 05:49:18,274 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:49:18,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,275 INFO L85 PathProgramCache]: Analyzing trace with hash -678669108, now seen corresponding path program 1 times [2025-02-08 05:49:18,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585472635] [2025-02-08 05:49:18,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 05:49:18,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 05:49:18,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:18,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585472635] [2025-02-08 05:49:18,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585472635] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 05:49:18,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642437841] [2025-02-08 05:49:18,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:49:18,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:49:18,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:49:18,321 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,327 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2025-02-08 05:49:18,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:49:18,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2025-02-08 05:49:18,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,329 INFO L225 Difference]: With dead ends: 20 [2025-02-08 05:49:18,329 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 05:49:18,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:49:18,330 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 05:49:18,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-02-08 05:49:18,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2025-02-08 05:49:18,334 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 25 transitions. Word has length 10 [2025-02-08 05:49:18,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,335 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 25 transitions. [2025-02-08 05:49:18,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 25 transitions. [2025-02-08 05:49:18,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 05:49:18,335 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,335 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:49:18,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 436095373, now seen corresponding path program 1 times [2025-02-08 05:49:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063254453] [2025-02-08 05:49:18,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 05:49:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 05:49:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:18,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063254453] [2025-02-08 05:49:18,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063254453] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:49:18,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125281091] [2025-02-08 05:49:18,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:49:18,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:49:18,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:18,501 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,524 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2025-02-08 05:49:18,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:49:18,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-02-08 05:49:18,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,529 INFO L225 Difference]: With dead ends: 21 [2025-02-08 05:49:18,529 INFO L226 Difference]: Without dead ends: 18 [2025-02-08 05:49:18,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:18,529 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 52 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-02-08 05:49:18,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2025-02-08 05:49:18,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2025-02-08 05:49:18,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 11 [2025-02-08 05:49:18,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,531 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2025-02-08 05:49:18,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,531 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2025-02-08 05:49:18,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 05:49:18,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,531 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:49:18,531 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,534 INFO L85 PathProgramCache]: Analyzing trace with hash 2087472369, now seen corresponding path program 1 times [2025-02-08 05:49:18,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193339184] [2025-02-08 05:49:18,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 05:49:18,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 05:49:18,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,638 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:49:18,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193339184] [2025-02-08 05:49:18,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193339184] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:49:18,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291685982] [2025-02-08 05:49:18,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:49:18,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:49:18,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:49:18,640 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,671 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2025-02-08 05:49:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:49:18,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2025-02-08 05:49:18,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,672 INFO L225 Difference]: With dead ends: 19 [2025-02-08 05:49:18,672 INFO L226 Difference]: Without dead ends: 19 [2025-02-08 05:49:18,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:18,673 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 50 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-02-08 05:49:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2025-02-08 05:49:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-08 05:49:18,674 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 13 [2025-02-08 05:49:18,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,674 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-08 05:49:18,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-08 05:49:18,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-02-08 05:49:18,678 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,678 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:49:18,679 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 288093357, now seen corresponding path program 1 times [2025-02-08 05:49:18,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92933902] [2025-02-08 05:49:18,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 05:49:18,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 05:49:18,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,770 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:18,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92933902] [2025-02-08 05:49:18,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92933902] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:18,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:49:18,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:49:18,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485040030] [2025-02-08 05:49:18,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:49:18,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:49:18,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:49:18,771 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-02-08 05:49:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:18,803 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2025-02-08 05:49:18,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:18,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-02-08 05:49:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:18,804 INFO L225 Difference]: With dead ends: 20 [2025-02-08 05:49:18,804 INFO L226 Difference]: Without dead ends: 20 [2025-02-08 05:49:18,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 05:49:18,805 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 2 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:18,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-02-08 05:49:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-02-08 05:49:18,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:18,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-02-08 05:49:18,806 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 14 [2025-02-08 05:49:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:18,807 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-02-08 05:49:18,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-02-08 05:49:18,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-02-08 05:49:18,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 05:49:18,807 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:18,807 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:18,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:49:18,807 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:18,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash 340960716, now seen corresponding path program 1 times [2025-02-08 05:49:18,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:18,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262539449] [2025-02-08 05:49:18,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:18,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 05:49:18,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 05:49:18,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262539449] [2025-02-08 05:49:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262539449] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743594865] [2025-02-08 05:49:18,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:18,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:18,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:18,866 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:18,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:49:18,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 05:49:18,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 05:49:18,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:18,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:18,925 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 05:49:18,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:18,965 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:18,965 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:18,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 05:49:18,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743594865] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:18,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-02-08 05:49:18,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136036795] [2025-02-08 05:49:18,993 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:18,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:49:18,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:18,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:49:18,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:49:18,994 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:19,089 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2025-02-08 05:49:19,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:19,090 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 05:49:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:19,094 INFO L225 Difference]: With dead ends: 39 [2025-02-08 05:49:19,094 INFO L226 Difference]: Without dead ends: 39 [2025-02-08 05:49:19,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:49:19,094 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:19,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 64 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:19,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-02-08 05:49:19,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 24. [2025-02-08 05:49:19,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2025-02-08 05:49:19,097 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2025-02-08 05:49:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:19,097 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2025-02-08 05:49:19,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,097 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2025-02-08 05:49:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 05:49:19,099 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:19,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:19,112 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:19,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,300 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:19,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:19,301 INFO L85 PathProgramCache]: Analyzing trace with hash 589103084, now seen corresponding path program 2 times [2025-02-08 05:49:19,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:19,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158644142] [2025-02-08 05:49:19,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:19,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:19,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 05:49:19,329 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:49:19,329 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:19,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 05:49:19,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:19,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158644142] [2025-02-08 05:49:19,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158644142] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:19,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263697601] [2025-02-08 05:49:19,452 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:19,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:19,454 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:19,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:49:19,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-02-08 05:49:19,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 05:49:19,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:19,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:49:19,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:19,579 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 05:49:19,579 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:19,619 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-08 05:49:19,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263697601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:19,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:19,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2025-02-08 05:49:19,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814787129] [2025-02-08 05:49:19,620 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:19,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 05:49:19,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:19,620 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 05:49:19,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:49:19,621 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:19,650 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2025-02-08 05:49:19,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:19,650 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 05:49:19,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:19,651 INFO L225 Difference]: With dead ends: 43 [2025-02-08 05:49:19,651 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 05:49:19,651 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:49:19,651 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 7 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:19,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 68 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 05:49:19,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 25. [2025-02-08 05:49:19,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-08 05:49:19,653 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 21 [2025-02-08 05:49:19,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:19,654 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-08 05:49:19,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:19,654 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-08 05:49:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-08 05:49:19,654 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:19,654 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:19,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:19,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,859 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:19,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:19,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1112029288, now seen corresponding path program 3 times [2025-02-08 05:49:19,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:19,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521103943] [2025-02-08 05:49:19,860 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:19,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:19,869 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-02-08 05:49:19,872 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 22 statements. [2025-02-08 05:49:19,873 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:49:19,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:19,982 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:19,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521103943] [2025-02-08 05:49:19,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521103943] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:19,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261246252] [2025-02-08 05:49:19,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:19,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:19,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:19,984 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:19,986 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 05:49:20,033 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 22 statements into 4 equivalence classes. [2025-02-08 05:49:20,047 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 22 statements. [2025-02-08 05:49:20,047 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:49:20,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:20,048 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 05:49:20,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:20,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:20,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:20,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2025-02-08 05:49:20,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2025-02-08 05:49:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:20,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:20,176 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:20,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261246252] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:20,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:20,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-02-08 05:49:20,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040804777] [2025-02-08 05:49:20,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:20,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:49:20,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:20,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:49:20,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:49:20,178 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:20,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:20,206 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2025-02-08 05:49:20,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 05:49:20,207 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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 22 [2025-02-08 05:49:20,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:20,207 INFO L225 Difference]: With dead ends: 26 [2025-02-08 05:49:20,207 INFO L226 Difference]: Without dead ends: 26 [2025-02-08 05:49:20,207 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:49:20,207 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:20,208 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:20,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-02-08 05:49:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-02-08 05:49:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:20,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2025-02-08 05:49:20,213 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 22 [2025-02-08 05:49:20,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:20,213 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2025-02-08 05:49:20,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:20,213 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2025-02-08 05:49:20,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 05:49:20,213 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:20,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:20,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 05:49:20,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:20,414 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:20,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:20,414 INFO L85 PathProgramCache]: Analyzing trace with hash 113170801, now seen corresponding path program 4 times [2025-02-08 05:49:20,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:20,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247089231] [2025-02-08 05:49:20,414 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:20,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:20,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:20,451 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-02-08 05:49:20,452 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:20,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:20,878 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:49:20,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247089231] [2025-02-08 05:49:20,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247089231] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:20,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [708319526] [2025-02-08 05:49:20,878 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:20,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:20,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:20,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:20,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 05:49:20,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-02-08 05:49:20,957 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 19 of 23 statements. [2025-02-08 05:49:20,957 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:20,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:20,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 66 conjuncts are in the unsatisfiable core [2025-02-08 05:49:20,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:20,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:21,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:21,035 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:21,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:49:21,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:21,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:49:21,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 05:49:21,264 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 05:49:21,265 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-02-08 05:49:21,267 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:49:21,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 05:49:21,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [708319526] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:21,440 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:21,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 12] total 23 [2025-02-08 05:49:21,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555060259] [2025-02-08 05:49:21,440 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:21,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:49:21,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:21,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:49:21,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:49:21,441 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:21,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:21,629 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2025-02-08 05:49:21,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 05:49:21,630 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 05:49:21,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:21,631 INFO L225 Difference]: With dead ends: 29 [2025-02-08 05:49:21,631 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 05:49:21,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-02-08 05:49:21,631 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:21,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 146 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 05:49:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-02-08 05:49:21,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-02-08 05:49:21,633 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2025-02-08 05:49:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-02-08 05:49:21,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-02-08 05:49:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-08 05:49:21,633 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:21,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:21,641 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 05:49:21,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 05:49:21,840 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:21,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:21,841 INFO L85 PathProgramCache]: Analyzing trace with hash -786671224, now seen corresponding path program 5 times [2025-02-08 05:49:21,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:21,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709647855] [2025-02-08 05:49:21,842 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:49:21,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:21,854 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-02-08 05:49:21,866 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:49:21,867 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 05:49:21,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:22,047 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:22,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709647855] [2025-02-08 05:49:22,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709647855] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:22,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902005588] [2025-02-08 05:49:22,047 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:49:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:22,049 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:22,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 05:49:22,103 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 24 statements into 4 equivalence classes. [2025-02-08 05:49:22,133 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:49:22,134 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-08 05:49:22,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:22,135 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 05:49:22,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:22,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:22,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:22,214 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:49:22,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:49:22,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:49:22,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:22,295 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-08 05:49:22,327 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 05:49:22,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 15 [2025-02-08 05:49:22,363 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:49:22,364 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:22,550 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 05:49:22,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902005588] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:22,551 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:22,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2025-02-08 05:49:22,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016167126] [2025-02-08 05:49:22,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:22,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 05:49:22,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:22,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 05:49:22,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2025-02-08 05:49:22,552 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 24 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-02-08 05:49:22,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:22,864 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-02-08 05:49:22,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:49:22,864 INFO L78 Accepts]: Start accepts. Automaton has has 24 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) Word has length 24 [2025-02-08 05:49:22,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:22,865 INFO L225 Difference]: With dead ends: 30 [2025-02-08 05:49:22,865 INFO L226 Difference]: Without dead ends: 30 [2025-02-08 05:49:22,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2025-02-08 05:49:22,866 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 3 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:22,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 229 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:49:22,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-08 05:49:22,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-02-08 05:49:22,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:22,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2025-02-08 05:49:22,867 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 24 [2025-02-08 05:49:22,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:22,867 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2025-02-08 05:49:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 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-02-08 05:49:22,868 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2025-02-08 05:49:22,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-08 05:49:22,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:22,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:22,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:23,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 05:49:23,075 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -138510452, now seen corresponding path program 6 times [2025-02-08 05:49:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216017470] [2025-02-08 05:49:23,077 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:49:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:23,087 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-02-08 05:49:23,095 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:23,096 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-08 05:49:23,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:23,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216017470] [2025-02-08 05:49:23,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216017470] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:23,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633456893] [2025-02-08 05:49:23,207 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:49:23,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:23,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:23,210 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:23,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 05:49:23,265 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 4 equivalence classes. [2025-02-08 05:49:23,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 05:49:23,289 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-02-08 05:49:23,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:49:23,291 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:23,348 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:49:23,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:49:23,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633456893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:49:23,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:49:23,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2025-02-08 05:49:23,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333342983] [2025-02-08 05:49:23,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:49:23,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:23,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:23,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:23,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:49:23,350 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:23,367 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2025-02-08 05:49:23,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:49:23,368 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 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 25 [2025-02-08 05:49:23,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:23,368 INFO L225 Difference]: With dead ends: 45 [2025-02-08 05:49:23,368 INFO L226 Difference]: Without dead ends: 29 [2025-02-08 05:49:23,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:49:23,369 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:23,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:23,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-02-08 05:49:23,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2025-02-08 05:49:23,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2025-02-08 05:49:23,370 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 25 [2025-02-08 05:49:23,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:23,371 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2025-02-08 05:49:23,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,371 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2025-02-08 05:49:23,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 05:49:23,371 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:23,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:23,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 05:49:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 05:49:23,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:23,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:23,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1573741769, now seen corresponding path program 1 times [2025-02-08 05:49:23,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:23,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008974844] [2025-02-08 05:49:23,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:23,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:23,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:23,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:23,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:49:23,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008974844] [2025-02-08 05:49:23,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008974844] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:23,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1509407462] [2025-02-08 05:49:23,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:23,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:23,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:23,619 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:23,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:49:23,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:23,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:23,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:23,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:23,693 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:49:23,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:23,703 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:49:23,703 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:23,717 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-08 05:49:23,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1509407462] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:23,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:23,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 05:49:23,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556642061] [2025-02-08 05:49:23,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:23,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 05:49:23,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:23,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 05:49:23,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-08 05:49:23,718 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:23,769 INFO L93 Difference]: Finished difference Result 86 states and 99 transitions. [2025-02-08 05:49:23,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:23,770 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 05:49:23,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:23,771 INFO L225 Difference]: With dead ends: 86 [2025-02-08 05:49:23,771 INFO L226 Difference]: Without dead ends: 86 [2025-02-08 05:49:23,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2025-02-08 05:49:23,772 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:23,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 58 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:23,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-02-08 05:49:23,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 37. [2025-02-08 05:49:23,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2025-02-08 05:49:23,774 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 28 [2025-02-08 05:49:23,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:23,774 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2025-02-08 05:49:23,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2025-02-08 05:49:23,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 05:49:23,775 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:23,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:23,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:23,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:23,976 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:23,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:23,976 INFO L85 PathProgramCache]: Analyzing trace with hash 328977288, now seen corresponding path program 1 times [2025-02-08 05:49:23,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:23,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771127267] [2025-02-08 05:49:23,977 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:23,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:23,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:23,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:23,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:23,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,040 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:24,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771127267] [2025-02-08 05:49:24,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771127267] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:24,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077575327] [2025-02-08 05:49:24,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:49:24,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:24,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:24,044 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:24,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:49:24,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 05:49:24,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 05:49:24,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:49:24,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:49:24,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:24,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077575327] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:24,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-08 05:49:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40182099] [2025-02-08 05:49:24,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:24,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 05:49:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:24,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 05:49:24,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-02-08 05:49:24,183 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:24,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:24,224 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2025-02-08 05:49:24,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 05:49:24,224 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-08 05:49:24,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:24,225 INFO L225 Difference]: With dead ends: 40 [2025-02-08 05:49:24,225 INFO L226 Difference]: Without dead ends: 40 [2025-02-08 05:49:24,225 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-08 05:49:24,225 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 38 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:24,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 56 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:24,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-08 05:49:24,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2025-02-08 05:49:24,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1794871794871795) internal successors, (46), 39 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2025-02-08 05:49:24,227 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 28 [2025-02-08 05:49:24,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:24,227 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2025-02-08 05:49:24,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2025-02-08 05:49:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 05:49:24,228 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:24,228 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:24,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:24,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:24,432 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:24,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:24,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1617822901, now seen corresponding path program 2 times [2025-02-08 05:49:24,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:24,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513475816] [2025-02-08 05:49:24,432 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:24,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:24,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 05:49:24,446 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:49:24,446 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:24,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,874 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:49:24,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513475816] [2025-02-08 05:49:24,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513475816] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:24,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090414845] [2025-02-08 05:49:24,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:49:24,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:24,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:24,877 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:24,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 05:49:24,936 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-02-08 05:49:24,961 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:49:24,961 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:49:24,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:24,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-02-08 05:49:24,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:24,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:24,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:25,000 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 05:49:25,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 05:49:25,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:25,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:49:25,087 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-08 05:49:25,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-08 05:49:25,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 05:49:25,174 INFO L349 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2025-02-08 05:49:25,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 38 [2025-02-08 05:49:25,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 05:49:25,381 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2025-02-08 05:49:25,381 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 26 [2025-02-08 05:49:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:49:25,385 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:28,159 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:28,245 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-08 05:49:28,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090414845] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:28,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:28,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2025-02-08 05:49:28,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294096040] [2025-02-08 05:49:28,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:28,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-02-08 05:49:28,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:28,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-02-08 05:49:28,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2025-02-08 05:49:28,497 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 30 states, 30 states have (on average 1.6666666666666667) 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-02-08 05:49:28,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:28,992 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2025-02-08 05:49:28,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 05:49:28,992 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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) Word has length 31 [2025-02-08 05:49:28,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:28,992 INFO L225 Difference]: With dead ends: 43 [2025-02-08 05:49:28,992 INFO L226 Difference]: Without dead ends: 43 [2025-02-08 05:49:28,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=202, Invalid=1358, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 05:49:28,993 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 7 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:28,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 204 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 05:49:28,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2025-02-08 05:49:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2025-02-08 05:49:28,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:28,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-02-08 05:49:28,995 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 31 [2025-02-08 05:49:28,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:28,995 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-02-08 05:49:28,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.6666666666666667) 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-02-08 05:49:28,995 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-02-08 05:49:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-08 05:49:28,995 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:28,995 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:29,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-08 05:49:29,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:29,200 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:29,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:29,200 INFO L85 PathProgramCache]: Analyzing trace with hash -134408663, now seen corresponding path program 3 times [2025-02-08 05:49:29,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:29,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14682287] [2025-02-08 05:49:29,200 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:29,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:29,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-02-08 05:49:29,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 32 statements. [2025-02-08 05:49:29,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 05:49:29,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 05:49:29,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14682287] [2025-02-08 05:49:29,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14682287] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:29,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [626663954] [2025-02-08 05:49:29,295 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:49:29,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:29,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:29,298 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:29,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 05:49:29,362 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 32 statements into 5 equivalence classes. [2025-02-08 05:49:29,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 32 statements. [2025-02-08 05:49:29,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 05:49:29,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:29,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:49:29,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:29,484 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 05:49:29,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:29,559 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-08 05:49:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [626663954] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:29,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2025-02-08 05:49:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734473083] [2025-02-08 05:49:29,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:29,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:49:29,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:29,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:49:29,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:49:29,560 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:29,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:29,594 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2025-02-08 05:49:29,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:29,595 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2025-02-08 05:49:29,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:29,595 INFO L225 Difference]: With dead ends: 61 [2025-02-08 05:49:29,595 INFO L226 Difference]: Without dead ends: 41 [2025-02-08 05:49:29,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:49:29,595 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:29,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:29,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2025-02-08 05:49:29,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2025-02-08 05:49:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2025-02-08 05:49:29,597 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 32 [2025-02-08 05:49:29,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:29,597 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2025-02-08 05:49:29,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 17 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:29,597 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2025-02-08 05:49:29,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-02-08 05:49:29,597 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:29,597 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:29,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-08 05:49:29,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 05:49:29,798 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:29,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:29,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1934464685, now seen corresponding path program 4 times [2025-02-08 05:49:29,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:29,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568380071] [2025-02-08 05:49:29,798 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:29,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:29,829 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 05:49:29,837 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 05:49:29,838 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:29,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-08 05:49:30,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568380071] [2025-02-08 05:49:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568380071] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134049859] [2025-02-08 05:49:30,082 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:49:30,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:30,084 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:30,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 05:49:30,164 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 35 statements into 2 equivalence classes. [2025-02-08 05:49:30,190 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 27 of 35 statements. [2025-02-08 05:49:30,190 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-02-08 05:49:30,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:30,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-02-08 05:49:30,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:30,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:30,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:30,287 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 05:49:30,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 05:49:30,334 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:30,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:49:30,379 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-02-08 05:49:30,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-02-08 05:49:30,436 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-08 05:49:30,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 38 [2025-02-08 05:49:30,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 05:49:30,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:30,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 05:49:30,832 INFO L349 Elim1Store]: treesize reduction 21, result has 16.0 percent of original size [2025-02-08 05:49:30,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 26 [2025-02-08 05:49:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 05:49:30,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:35,377 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:35,629 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 24 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:49:35,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134049859] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:35,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:35,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 17, 15] total 36 [2025-02-08 05:49:35,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233058461] [2025-02-08 05:49:35,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:35,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 05:49:35,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:35,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 05:49:35,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1160, Unknown=1, NotChecked=0, Total=1260 [2025-02-08 05:49:35,631 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:36,295 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2025-02-08 05:49:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 05:49:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-02-08 05:49:36,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:36,296 INFO L225 Difference]: With dead ends: 44 [2025-02-08 05:49:36,296 INFO L226 Difference]: Without dead ends: 44 [2025-02-08 05:49:36,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=195, Invalid=1784, Unknown=1, NotChecked=0, Total=1980 [2025-02-08 05:49:36,297 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 497 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 497 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:36,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 497 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 05:49:36,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-02-08 05:49:36,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2025-02-08 05:49:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:36,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2025-02-08 05:49:36,298 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 35 [2025-02-08 05:49:36,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:36,299 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2025-02-08 05:49:36,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.6388888888888888) internal successors, (59), 36 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:36,299 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2025-02-08 05:49:36,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-08 05:49:36,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:36,299 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:36,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 05:49:36,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 05:49:36,500 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:36,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -161135668, now seen corresponding path program 5 times [2025-02-08 05:49:36,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:36,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500459372] [2025-02-08 05:49:36,500 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:49:36,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:36,508 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-02-08 05:49:36,516 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:36,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 05:49:36,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 05:49:36,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500459372] [2025-02-08 05:49:36,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500459372] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:36,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1534257472] [2025-02-08 05:49:36,602 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:49:36,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:36,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:36,603 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:36,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 05:49:36,673 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 5 equivalence classes. [2025-02-08 05:49:36,721 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 36 of 36 statements. [2025-02-08 05:49:36,721 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-02-08 05:49:36,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:36,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:49:36,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 05:49:36,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-08 05:49:36,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1534257472] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:49:36,813 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:49:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2025-02-08 05:49:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833992684] [2025-02-08 05:49:36,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:49:36,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:49:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:49:36,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:49:36,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:49:36,814 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:36,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:49:36,875 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2025-02-08 05:49:36,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:49:36,876 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-02-08 05:49:36,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:49:36,876 INFO L225 Difference]: With dead ends: 45 [2025-02-08 05:49:36,876 INFO L226 Difference]: Without dead ends: 45 [2025-02-08 05:49:36,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:49:36,876 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 05:49:36,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 58 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 05:49:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-02-08 05:49:36,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2025-02-08 05:49:36,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 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-02-08 05:49:36,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2025-02-08 05:49:36,878 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 36 [2025-02-08 05:49:36,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:49:36,878 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2025-02-08 05:49:36,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:49:36,878 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2025-02-08 05:49:36,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 05:49:36,878 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:49:36,878 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:49:36,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 05:49:37,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 05:49:37,086 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:49:37,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:49:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1816822897, now seen corresponding path program 6 times [2025-02-08 05:49:37,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:49:37,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311154783] [2025-02-08 05:49:37,086 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:49:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:49:37,095 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 6 equivalence classes. [2025-02-08 05:49:37,112 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:37,112 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-08 05:49:37,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 46 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 05:49:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:49:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311154783] [2025-02-08 05:49:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311154783] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:49:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692669369] [2025-02-08 05:49:38,451 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-08 05:49:38,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:49:38,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:49:38,453 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:49:38,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 05:49:38,531 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 39 statements into 6 equivalence classes. [2025-02-08 05:49:38,588 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 05:49:38,588 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2025-02-08 05:49:38,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:49:38,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-02-08 05:49:38,593 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:49:38,600 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:49:38,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:49:38,640 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 05:49:38,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 05:49:38,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:49:38,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:49:38,805 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-08 05:49:38,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-02-08 05:49:38,894 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-08 05:49:38,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 43 [2025-02-08 05:49:38,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 05:49:38,960 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:38,974 INFO L349 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2025-02-08 05:49:38,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2025-02-08 05:49:39,082 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-02-08 05:49:39,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 63 [2025-02-08 05:49:39,093 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:39,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:39,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2025-02-08 05:49:39,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:39,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:39,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:49:39,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2025-02-08 05:49:39,466 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:49:39,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:49:41,226 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:41,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20726 treesize of output 20214 [2025-02-08 05:49:55,625 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:55,646 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-08 05:49:55,912 INFO L349 Elim1Store]: treesize reduction 88, result has 59.4 percent of original size [2025-02-08 05:49:55,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 24 case distinctions, treesize of input 167008375 treesize of output 164292863 [2025-02-08 05:50:40,208 WARN L286 SmtUtils]: Spent 44.28s on a formula simplification. DAG size of input: 3859 DAG size of output: 251 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-02-08 05:50:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 5 proven. 40 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:50:42,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692669369] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:50:42,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:50:42,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 45 [2025-02-08 05:50:42,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50666137] [2025-02-08 05:50:42,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:50:42,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 05:50:42,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:50:42,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 05:50:42,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1851, Unknown=4, NotChecked=0, Total=1980 [2025-02-08 05:50:42,222 INFO L87 Difference]: Start difference. First operand 45 states and 50 transitions. Second operand has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:44,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:50:44,965 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2025-02-08 05:50:44,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 05:50:44,966 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 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 39 [2025-02-08 05:50:44,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:50:44,967 INFO L225 Difference]: With dead ends: 49 [2025-02-08 05:50:44,967 INFO L226 Difference]: Without dead ends: 49 [2025-02-08 05:50:44,969 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=315, Invalid=3103, Unknown=4, NotChecked=0, Total=3422 [2025-02-08 05:50:44,970 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 855 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 05:50:44,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 855 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 05:50:44,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2025-02-08 05:50:44,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2025-02-08 05:50:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:44,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 52 transitions. [2025-02-08 05:50:44,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 52 transitions. Word has length 39 [2025-02-08 05:50:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:50:44,975 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 52 transitions. [2025-02-08 05:50:44,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.5555555555555556) internal successors, (70), 45 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:44,975 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2025-02-08 05:50:44,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-02-08 05:50:44,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:50:44,976 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:50:44,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-08 05:50:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:45,177 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:50:45,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:50:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash 330270668, now seen corresponding path program 7 times [2025-02-08 05:50:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:50:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644432192] [2025-02-08 05:50:45,177 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:50:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:50:45,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:50:45,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:50:45,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:50:45,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:45,517 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 05:50:45,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:50:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644432192] [2025-02-08 05:50:45,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644432192] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:50:45,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1067250861] [2025-02-08 05:50:45,517 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-08 05:50:45,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:45,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:50:45,519 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:50:45,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 05:50:45,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:50:45,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:50:45,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:50:45,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:45,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 05:50:45,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:50:45,871 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 05:50:45,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:50:46,063 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 15 proven. 9 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-08 05:50:46,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1067250861] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:50:46,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:50:46,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2025-02-08 05:50:46,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877718901] [2025-02-08 05:50:46,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:50:46,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 05:50:46,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:50:46,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 05:50:46,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-08 05:50:46,065 INFO L87 Difference]: Start difference. First operand 47 states and 52 transitions. Second operand has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:46,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:50:46,168 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-02-08 05:50:46,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:50:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 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 41 [2025-02-08 05:50:46,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:50:46,169 INFO L225 Difference]: With dead ends: 71 [2025-02-08 05:50:46,169 INFO L226 Difference]: Without dead ends: 47 [2025-02-08 05:50:46,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2025-02-08 05:50:46,170 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:50:46,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:50:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2025-02-08 05:50:46,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2025-02-08 05:50:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.108695652173913) internal successors, (51), 46 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:46,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2025-02-08 05:50:46,175 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2025-02-08 05:50:46,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:50:46,175 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2025-02-08 05:50:46,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 20 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2025-02-08 05:50:46,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 05:50:46,176 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:50:46,176 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:50:46,184 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-02-08 05:50:46,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:46,381 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:50:46,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:50:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 13458376, now seen corresponding path program 8 times [2025-02-08 05:50:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:50:46,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850575917] [2025-02-08 05:50:46,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:50:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:50:46,392 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 05:50:46,397 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:50:46,398 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:50:46,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 9 proven. 44 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 05:50:46,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:50:46,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850575917] [2025-02-08 05:50:46,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850575917] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:50:46,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630594239] [2025-02-08 05:50:46,594 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:50:46,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:46,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:50:46,596 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:50:46,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 05:50:46,682 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-08 05:50:46,711 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:50:46,711 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:50:46,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:46,715 INFO L256 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-08 05:50:46,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:50:46,799 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 05:50:46,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:50:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 35 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 05:50:46,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630594239] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:50:46,969 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:50:46,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2025-02-08 05:50:46,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98743698] [2025-02-08 05:50:46,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:50:46,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-08 05:50:46,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:50:46,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-08 05:50:46,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2025-02-08 05:50:46,970 INFO L87 Difference]: Start difference. First operand 47 states and 51 transitions. Second operand has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:47,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 05:50:47,134 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2025-02-08 05:50:47,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 05:50:47,134 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-02-08 05:50:47,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 05:50:47,136 INFO L225 Difference]: With dead ends: 50 [2025-02-08 05:50:47,136 INFO L226 Difference]: Without dead ends: 50 [2025-02-08 05:50:47,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 10 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=225, Unknown=0, NotChecked=0, Total=342 [2025-02-08 05:50:47,136 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 05:50:47,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 77 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 05:50:47,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-02-08 05:50:47,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2025-02-08 05:50:47,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:47,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2025-02-08 05:50:47,144 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 44 [2025-02-08 05:50:47,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 05:50:47,144 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2025-02-08 05:50:47,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.142857142857143) internal successors, (44), 13 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:50:47,144 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2025-02-08 05:50:47,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-02-08 05:50:47,144 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 05:50:47,144 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:50:47,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 05:50:47,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:47,345 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2025-02-08 05:50:47,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:50:47,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1455538379, now seen corresponding path program 9 times [2025-02-08 05:50:47,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:50:47,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180477630] [2025-02-08 05:50:47,346 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:50:47,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:50:47,355 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-02-08 05:50:47,413 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:50:47,413 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 05:50:47,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 48 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 05:50:49,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:50:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180477630] [2025-02-08 05:50:49,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180477630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:50:49,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472494918] [2025-02-08 05:50:49,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:50:49,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:50:49,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:50:49,463 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:50:49,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 05:50:49,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 47 statements into 7 equivalence classes. [2025-02-08 05:50:49,647 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 47 of 47 statements. [2025-02-08 05:50:49,648 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-02-08 05:50:49,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:50:49,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-02-08 05:50:49,656 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:50:49,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-02-08 05:50:49,687 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 05:50:49,716 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 05:50:49,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-08 05:50:49,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2025-02-08 05:50:49,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 05:50:49,888 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2025-02-08 05:50:49,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2025-02-08 05:50:50,035 INFO L349 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2025-02-08 05:50:50,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 43 [2025-02-08 05:50:50,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-02-08 05:50:50,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,195 INFO L349 Elim1Store]: treesize reduction 90, result has 36.6 percent of original size [2025-02-08 05:50:50,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 39 treesize of output 69 [2025-02-08 05:50:50,394 INFO L349 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2025-02-08 05:50:50,394 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 153 treesize of output 73 [2025-02-08 05:50:50,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2025-02-08 05:50:50,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,563 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2025-02-08 05:50:50,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 56 [2025-02-08 05:50:50,746 INFO L349 Elim1Store]: treesize reduction 120, result has 15.5 percent of original size [2025-02-08 05:50:50,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 206 treesize of output 88 [2025-02-08 05:50:50,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:50,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 62 [2025-02-08 05:50:52,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 05:50:52,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 13 [2025-02-08 05:50:52,729 INFO L349 Elim1Store]: treesize reduction 56, result has 30.9 percent of original size [2025-02-08 05:50:52,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 152 treesize of output 60 [2025-02-08 05:50:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 6 proven. 74 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 05:50:52,775 INFO L312 TraceCheckSpWp]: Computing backward predicates...