./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:20:07,702 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:20:07,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:20:07,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:20:07,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:20:07,787 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:20:07,788 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:20:07,788 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:20:07,788 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:20:07,788 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:20:07,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:20:07,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:20:07,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:20:07,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:20:07,791 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:20:07,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:20:07,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:20:07,792 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:20:07,793 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:20:07,793 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:20:07,794 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:20:07,794 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2025-03-17 12:20:08,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:20:08,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:20:08,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:20:08,064 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:20:08,064 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:20:08,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-03-17 12:20:09,171 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cdd6ad5/4704ef9edef14f2ab1b2ee2ca9b2c0da/FLAGe7b7dfdc5 [2025-03-17 12:20:09,554 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:20:09,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-03-17 12:20:09,570 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cdd6ad5/4704ef9edef14f2ab1b2ee2ca9b2c0da/FLAGe7b7dfdc5 [2025-03-17 12:20:09,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7cdd6ad5/4704ef9edef14f2ab1b2ee2ca9b2c0da [2025-03-17 12:20:09,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:20:09,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:20:09,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:20:09,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:20:09,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:20:09,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:20:09" (1/1) ... [2025-03-17 12:20:09,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@474b80d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:09, skipping insertion in model container [2025-03-17 12:20:09,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:20:09" (1/1) ... [2025-03-17 12:20:09,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:20:10,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:20:10,046 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:20:10,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:20:10,109 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:20:10,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10 WrapperNode [2025-03-17 12:20:10,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:20:10,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:20:10,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:20:10,111 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:20:10,116 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,149 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-03-17 12:20:10,151 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:20:10,152 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:20:10,152 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:20:10,152 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:20:10,159 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,160 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,178 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-03-17 12:20:10,179 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,179 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,185 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,187 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,193 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:20:10,193 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:20:10,193 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:20:10,193 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:20:10,194 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (1/1) ... [2025-03-17 12:20:10,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:20:10,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:10,218 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:20:10,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:20:10,237 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-17 12:20:10,238 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:20:10,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:20:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:20:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:20:10,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:20:10,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:20:10,320 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:20:10,322 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:20:10,353 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-17 12:20:10,552 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-17 12:20:10,553 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:20:10,561 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:20:10,562 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:20:10,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:20:10 BoogieIcfgContainer [2025-03-17 12:20:10,563 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:20:10,565 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:20:10,565 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:20:10,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:20:10,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:20:09" (1/3) ... [2025-03-17 12:20:10,569 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d48bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:20:10, skipping insertion in model container [2025-03-17 12:20:10,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:20:10" (2/3) ... [2025-03-17 12:20:10,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78d48bb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:20:10, skipping insertion in model container [2025-03-17 12:20:10,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:20:10" (3/3) ... [2025-03-17 12:20:10,571 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2025-03-17 12:20:10,582 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:20:10,584 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_circular_traversal-1.i that has 2 procedures, 72 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-03-17 12:20:10,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:20:10,635 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;@7851f7c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:20:10,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-17 12:20:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 40 states have (on average 1.975) internal successors, (79), 69 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:10,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:20:10,646 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:10,647 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:20:10,648 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:10,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:10,655 INFO L85 PathProgramCache]: Analyzing trace with hash 114160, now seen corresponding path program 1 times [2025-03-17 12:20:10,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:10,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-03-17 12:20:10,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:10,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:20:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:20:10,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:10,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:10,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:10,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:10,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758210321] [2025-03-17 12:20:10,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758210321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:10,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:10,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:20:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336788126] [2025-03-17 12:20:10,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:10,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:10,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:10,850 INFO L87 Difference]: Start difference. First operand has 71 states, 40 states have (on average 1.975) internal successors, (79), 69 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:10,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:10,905 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2025-03-17 12:20:10,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:10,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 12:20:10,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:10,910 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:20:10,910 INFO L226 Difference]: Without dead ends: 61 [2025-03-17 12:20:10,911 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:10,912 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:10,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 92 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:10,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-17 12:20:10,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-03-17 12:20:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.8055555555555556) internal successors, (65), 60 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:10,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-03-17 12:20:10,937 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 3 [2025-03-17 12:20:10,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:10,938 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-03-17 12:20:10,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:10,938 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-03-17 12:20:10,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:20:10,938 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:10,938 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:20:10,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:20:10,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:10,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:10,939 INFO L85 PathProgramCache]: Analyzing trace with hash 114161, now seen corresponding path program 1 times [2025-03-17 12:20:10,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:10,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-17 12:20:10,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:10,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:10,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:20:10,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:20:10,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:10,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95806922] [2025-03-17 12:20:11,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95806922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:20:11,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381265730] [2025-03-17 12:20:11,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:11,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,108 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,170 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-17 12:20:11,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:11,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2025-03-17 12:20:11,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,173 INFO L225 Difference]: With dead ends: 58 [2025-03-17 12:20:11,173 INFO L226 Difference]: Without dead ends: 58 [2025-03-17 12:20:11,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,174 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:11,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 87 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:11,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-17 12:20:11,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-17 12:20:11,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-03-17 12:20:11,183 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 3 [2025-03-17 12:20:11,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,183 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-03-17 12:20:11,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,183 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-03-17 12:20:11,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:20:11,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:20:11,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:11,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,184 INFO L85 PathProgramCache]: Analyzing trace with hash -122368873, now seen corresponding path program 1 times [2025-03-17 12:20:11,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476492036] [2025-03-17 12:20:11,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:20:11,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:20:11,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476492036] [2025-03-17 12:20:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476492036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:11,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107982346] [2025-03-17 12:20:11,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:11,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:11,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,279 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,332 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-17 12:20:11,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:11,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,333 INFO L225 Difference]: With dead ends: 56 [2025-03-17 12:20:11,333 INFO L226 Difference]: Without dead ends: 56 [2025-03-17 12:20:11,333 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,334 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:11,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 87 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:11,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-17 12:20:11,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-17 12:20:11,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 36 states have (on average 1.6666666666666667) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-03-17 12:20:11,341 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 8 [2025-03-17 12:20:11,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,342 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-03-17 12:20:11,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-03-17 12:20:11,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-17 12:20:11,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,342 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:20:11,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:11,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,343 INFO L85 PathProgramCache]: Analyzing trace with hash -122368872, now seen corresponding path program 1 times [2025-03-17 12:20:11,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-03-17 12:20:11,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-17 12:20:11,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-17 12:20:11,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641316923] [2025-03-17 12:20:11,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641316923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:11,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390150781] [2025-03-17 12:20:11,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:11,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:11,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,437 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,461 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2025-03-17 12:20:11,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:11,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,462 INFO L225 Difference]: With dead ends: 54 [2025-03-17 12:20:11,462 INFO L226 Difference]: Without dead ends: 54 [2025-03-17 12:20:11,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,462 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 2 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:11,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 92 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:11,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-17 12:20:11,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2025-03-17 12:20:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.6111111111111112) internal successors, (58), 53 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2025-03-17 12:20:11,465 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 8 [2025-03-17 12:20:11,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,465 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2025-03-17 12:20:11,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-03-17 12:20:11,465 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2025-03-17 12:20:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:20:11,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,466 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:20:11,466 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:11,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,466 INFO L85 PathProgramCache]: Analyzing trace with hash 501550269, now seen corresponding path program 1 times [2025-03-17 12:20:11,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-03-17 12:20:11,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:20:11,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:20:11,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817606132] [2025-03-17 12:20:11,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817606132] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:11,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:11,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:20:11,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862199838] [2025-03-17 12:20:11,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:20:11,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:20:11,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,500 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,510 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2025-03-17 12:20:11,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:20:11,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2025-03-17 12:20:11,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,510 INFO L225 Difference]: With dead ends: 59 [2025-03-17 12:20:11,511 INFO L226 Difference]: Without dead ends: 59 [2025-03-17 12:20:11,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:20:11,511 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:11,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 105 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:11,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-17 12:20:11,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2025-03-17 12:20:11,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 54 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-03-17 12:20:11,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-03-17 12:20:11,514 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 9 [2025-03-17 12:20:11,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,515 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-03-17 12:20:11,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,515 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-03-17 12:20:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-17 12:20:11,515 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,515 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:20:11,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:11,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2002583388, now seen corresponding path program 1 times [2025-03-17 12:20:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 12:20:11,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:11,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:20:11,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:20:11,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,580 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:11,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71091225] [2025-03-17 12:20:11,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71091225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:11,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380691795] [2025-03-17 12:20:11,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:11,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:11,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:11,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:11,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:20:11,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-17 12:20:11,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-17 12:20:11,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:11,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:11,684 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:20:11,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:11,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:11,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:20:11,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380691795] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:11,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:11,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-17 12:20:11,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752789115] [2025-03-17 12:20:11,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:11,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:20:11,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:11,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:20:11,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:11,759 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:11,776 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-03-17 12:20:11,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-17 12:20:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:11,777 INFO L225 Difference]: With dead ends: 70 [2025-03-17 12:20:11,777 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:20:11,778 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:11,778 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:11,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 111 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:20:11,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:20:11,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 12:20:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-17 12:20:11,782 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 14 [2025-03-17 12:20:11,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:11,782 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-17 12:20:11,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:11,782 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-17 12:20:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:20:11,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:11,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:11,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:20:11,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 12:20:11,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:11,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:11,984 INFO L85 PathProgramCache]: Analyzing trace with hash -164051587, now seen corresponding path program 2 times [2025-03-17 12:20:11,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:11,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-03-17 12:20:11,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:11,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-17 12:20:12,022 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:12,022 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:12,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-17 12:20:12,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505731106] [2025-03-17 12:20:12,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505731106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:20:12,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051517470] [2025-03-17 12:20:12,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:20:12,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:20:12,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:12,113 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,203 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2025-03-17 12:20:12,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:12,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 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 29 [2025-03-17 12:20:12,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,204 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:20:12,204 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:20:12,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03-17 12:20:12,204 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 91 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:20:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 12:20:12,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2025-03-17 12:20:12,209 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 29 [2025-03-17 12:20:12,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,209 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2025-03-17 12:20:12,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,209 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2025-03-17 12:20:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-17 12:20:12,210 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,210 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:20:12,210 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:12,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,211 INFO L85 PathProgramCache]: Analyzing trace with hash -164051586, now seen corresponding path program 1 times [2025-03-17 12:20:12,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 12:20:12,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-17 12:20:12,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-17 12:20:12,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 12:20:12,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:12,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217811552] [2025-03-17 12:20:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217811552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:12,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:20:12,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323781388] [2025-03-17 12:20:12,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:20:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:12,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:20:12,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:20:12,435 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:12,530 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2025-03-17 12:20:12,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:20:12,533 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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 29 [2025-03-17 12:20:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:12,534 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:20:12,534 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:20:12,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03-17 12:20:12,535 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:12,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 130 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:20:12,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2025-03-17 12:20:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2025-03-17 12:20:12,541 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 29 [2025-03-17 12:20:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:12,541 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2025-03-17 12:20:12,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2025-03-17 12:20:12,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 12:20:12,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:12,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:12,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:20:12,542 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash -113644143, now seen corresponding path program 1 times [2025-03-17 12:20:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513687340] [2025-03-17 12:20:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:12,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:12,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:20:12,610 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:20:12,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:12,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-17 12:20:13,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513687340] [2025-03-17 12:20:13,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513687340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:13,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860809661] [2025-03-17 12:20:13,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:13,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:13,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:13,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:13,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:20:13,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 12:20:13,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 12:20:13,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:13,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:13,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-17 12:20:13,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:13,681 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 13 treesize of output 9 [2025-03-17 12:20:13,756 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:20:13,757 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 25 treesize of output 13 [2025-03-17 12:20:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 12:20:13,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:14,125 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 12:20:14,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860809661] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:14,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:14,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 23 [2025-03-17 12:20:14,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517520122] [2025-03-17 12:20:14,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:14,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 12:20:14,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:14,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 12:20:14,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=481, Unknown=0, NotChecked=0, Total=552 [2025-03-17 12:20:14,129 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:14,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:14,451 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2025-03-17 12:20:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 12:20:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2025-03-17 12:20:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:14,452 INFO L225 Difference]: With dead ends: 70 [2025-03-17 12:20:14,452 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:20:14,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:20:14,453 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:14,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 507 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 12:20:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:20:14,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 12:20:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 69 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2025-03-17 12:20:14,457 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 33 [2025-03-17 12:20:14,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:14,457 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2025-03-17 12:20:14,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.7916666666666665) internal successors, (67), 23 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:14,457 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2025-03-17 12:20:14,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:20:14,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:14,458 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:14,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-17 12:20:14,658 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:14,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1773960925, now seen corresponding path program 1 times [2025-03-17 12:20:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:14,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-17 12:20:14,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:14,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:20:14,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:14,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:14,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:15,155 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 23 proven. 1 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-17 12:20:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501857509] [2025-03-17 12:20:15,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501857509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:15,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703680746] [2025-03-17 12:20:15,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:15,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:15,158 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:15,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:20:15,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:20:15,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:15,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:15,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:15,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-17 12:20:15,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:15,311 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-03-17 12:20:15,337 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:20:15,337 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:20:15,362 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-03-17 12:20:15,383 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 33 treesize of output 17 [2025-03-17 12:20:15,433 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 12:20:15,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-17 12:20:15,565 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:20:15,565 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-03-17 12:20:15,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:15,585 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2025-03-17 12:20:15,597 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:15,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:15,779 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:15,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [703680746] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:15,779 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:15,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 22 [2025-03-17 12:20:15,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627384604] [2025-03-17 12:20:15,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:15,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-17 12:20:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:15,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-17 12:20:15,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2025-03-17 12:20:15,780 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:16,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:16,169 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2025-03-17 12:20:16,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 12:20:16,170 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 12:20:16,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:16,170 INFO L225 Difference]: With dead ends: 75 [2025-03-17 12:20:16,170 INFO L226 Difference]: Without dead ends: 75 [2025-03-17 12:20:16,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-03-17 12:20:16,171 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 24 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:16,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 273 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 12:20:16,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-17 12:20:16,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-17 12:20:16,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3442622950819672) internal successors, (82), 74 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:16,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-17 12:20:16,178 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 35 [2025-03-17 12:20:16,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:16,178 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-17 12:20:16,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 23 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:16,178 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-17 12:20:16,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:20:16,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:16,178 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:16,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:16,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:16,379 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:16,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:16,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1773960924, now seen corresponding path program 1 times [2025-03-17 12:20:16,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:16,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-03-17 12:20:16,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:16,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:20:16,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:16,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:16,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:17,088 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:17,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122729135] [2025-03-17 12:20:17,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122729135] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:17,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423764901] [2025-03-17 12:20:17,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:17,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:17,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:17,093 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:17,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:20:17,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:20:17,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:20:17,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:17,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:17,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-17 12:20:17,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:17,224 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 8 treesize of output 1 [2025-03-17 12:20:17,288 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:20:17,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:20:17,331 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-03-17 12:20:17,335 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-03-17 12:20:17,369 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 33 treesize of output 17 [2025-03-17 12:20:17,376 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 11 [2025-03-17 12:20:17,441 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 12:20:17,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-17 12:20:17,451 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 12:20:17,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 12:20:17,634 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:20:17,634 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2025-03-17 12:20:17,639 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:20:17,639 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2025-03-17 12:20:17,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:17,668 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-03-17 12:20:17,676 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:17,677 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2025-03-17 12:20:17,788 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:17,788 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:18,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [423764901] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:18,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:18,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 31 [2025-03-17 12:20:18,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163986276] [2025-03-17 12:20:18,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:18,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 12:20:18,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:18,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 12:20:18,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=891, Unknown=0, NotChecked=0, Total=992 [2025-03-17 12:20:18,270 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:18,950 INFO L93 Difference]: Finished difference Result 100 states and 111 transitions. [2025-03-17 12:20:18,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:20:18,951 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 12:20:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:18,952 INFO L225 Difference]: With dead ends: 100 [2025-03-17 12:20:18,952 INFO L226 Difference]: Without dead ends: 100 [2025-03-17 12:20:18,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 455 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=214, Invalid=1678, Unknown=0, NotChecked=0, Total=1892 [2025-03-17 12:20:18,953 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 97 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:18,953 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 369 Invalid, 782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 12:20:18,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-17 12:20:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2025-03-17 12:20:18,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 84 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 98 transitions. [2025-03-17 12:20:18,956 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 98 transitions. Word has length 35 [2025-03-17 12:20:18,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:18,956 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 98 transitions. [2025-03-17 12:20:18,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.5806451612903225) internal successors, (80), 32 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:18,956 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 98 transitions. [2025-03-17 12:20:18,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-17 12:20:18,957 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:18,957 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:18,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 12:20:19,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:19,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:19,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:19,158 INFO L85 PathProgramCache]: Analyzing trace with hash 841786740, now seen corresponding path program 1 times [2025-03-17 12:20:19,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:19,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-17 12:20:19,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:19,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-17 12:20:19,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-17 12:20:19,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-17 12:20:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:19,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711101529] [2025-03-17 12:20:19,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711101529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:20:19,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:20:19,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 12:20:19,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393549502] [2025-03-17 12:20:19,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:20:19,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 12:20:19,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:19,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 12:20:19,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:20:19,327 INFO L87 Difference]: Start difference. First operand 85 states and 98 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:19,411 INFO L93 Difference]: Finished difference Result 88 states and 97 transitions. [2025-03-17 12:20:19,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:20:19,411 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2025-03-17 12:20:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:19,412 INFO L225 Difference]: With dead ends: 88 [2025-03-17 12:20:19,412 INFO L226 Difference]: Without dead ends: 88 [2025-03-17 12:20:19,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:20:19,412 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 83 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:19,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 95 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:20:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-17 12:20:19,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2025-03-17 12:20:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.3) internal successors, (91), 81 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2025-03-17 12:20:19,419 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 36 [2025-03-17 12:20:19,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:19,419 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2025-03-17 12:20:19,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:19,419 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2025-03-17 12:20:19,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:20:19,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:19,420 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:19,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:20:19,420 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:19,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:19,420 INFO L85 PathProgramCache]: Analyzing trace with hash -661494217, now seen corresponding path program 1 times [2025-03-17 12:20:19,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:19,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-03-17 12:20:19,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:19,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:19,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:20:19,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:20:19,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:19,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:20,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:20,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077683538] [2025-03-17 12:20:20,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077683538] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:20,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1308431626] [2025-03-17 12:20:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:20,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:20,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:20,398 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:20,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:20:20,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:20:20,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:20:20,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:20,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:20,518 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-17 12:20:20,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:20,529 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-03-17 12:20:20,585 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:20:20,586 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-03-17 12:20:20,681 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-17 12:20:20,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-03-17 12:20:20,770 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 12:20:20,770 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 22 treesize of output 33 [2025-03-17 12:20:20,857 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 11 treesize of output 7 [2025-03-17 12:20:20,972 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-17 12:20:20,972 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 21 treesize of output 25 [2025-03-17 12:20:21,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-03-17 12:20:21,022 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 11 treesize of output 7 [2025-03-17 12:20:21,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:20:21,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:20:21,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-17 12:20:21,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:20:21,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:20:21,149 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 36 treesize of output 27 [2025-03-17 12:20:21,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:20:21,241 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 35 treesize of output 19 [2025-03-17 12:20:21,247 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 20 treesize of output 15 [2025-03-17 12:20:21,262 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 11 [2025-03-17 12:20:21,269 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 27 treesize of output 15 [2025-03-17 12:20:21,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2025-03-17 12:20:21,342 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 23 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-17 12:20:21,342 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:21,471 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1042) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-03-17 12:20:21,557 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-03-17 12:20:21,570 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_1036)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1033 .cse0)) v_ArrVal_1033))))) is different from false [2025-03-17 12:20:21,575 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 102 treesize of output 100 [2025-03-17 12:20:21,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 41 treesize of output 39 [2025-03-17 12:20:21,601 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,601 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 72 [2025-03-17 12:20:21,604 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 110 treesize of output 98 [2025-03-17 12:20:21,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 [2025-03-17 12:20:21,625 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_1037 (Array Int Int)) (v_arrayElimCell_46 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) v_arrayElimCell_46) (+ 4 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042))) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_48 Int)) (= (select (select .cse1 v_arrayElimCell_46) (+ 4 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse0))) is different from false [2025-03-17 12:20:21,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,855 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-03-17 12:20:21,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,863 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-03-17 12:20:21,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 7 [2025-03-17 12:20:21,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,871 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2025-03-17 12:20:21,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,879 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 269 treesize of output 250 [2025-03-17 12:20:21,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,890 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 51 treesize of output 51 [2025-03-17 12:20:21,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,912 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 57 treesize of output 49 [2025-03-17 12:20:21,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:21,976 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-17 12:20:21,978 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:21,983 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 36 treesize of output 24 [2025-03-17 12:20:21,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-03-17 12:20:22,593 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 5 trivial. 12 not checked. [2025-03-17 12:20:22,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1308431626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:22,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:22,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 16] total 44 [2025-03-17 12:20:22,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229205945] [2025-03-17 12:20:22,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:22,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-17 12:20:22,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:22,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-17 12:20:22,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1493, Unknown=42, NotChecked=324, Total=1980 [2025-03-17 12:20:22,594 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:23,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:23,959 INFO L93 Difference]: Finished difference Result 95 states and 103 transitions. [2025-03-17 12:20:23,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:20:23,960 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 12:20:23,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:23,960 INFO L225 Difference]: With dead ends: 95 [2025-03-17 12:20:23,960 INFO L226 Difference]: Without dead ends: 95 [2025-03-17 12:20:23,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 51 SyntacticMatches, 4 SemanticMatches, 60 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=345, Invalid=2932, Unknown=45, NotChecked=460, Total=3782 [2025-03-17 12:20:23,961 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 63 mSDsluCounter, 734 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 242 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:23,962 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 762 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1137 Invalid, 0 Unknown, 242 Unchecked, 0.6s Time] [2025-03-17 12:20:23,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-17 12:20:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2025-03-17 12:20:23,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 81 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:23,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2025-03-17 12:20:23,965 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 39 [2025-03-17 12:20:23,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:23,966 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2025-03-17 12:20:23,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.2666666666666666) internal successors, (102), 44 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2025-03-17 12:20:23,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 12:20:23,968 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:23,968 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:23,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:20:24,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-17 12:20:24,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1470703672, now seen corresponding path program 1 times [2025-03-17 12:20:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:24,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-03-17 12:20:24,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:24,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:24,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:20:24,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:20:24,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:24,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 12:20:24,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:24,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171715896] [2025-03-17 12:20:24,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171715896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:24,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361337861] [2025-03-17 12:20:24,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:20:24,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:24,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:24,574 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:24,575 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:20:24,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 12:20:24,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 12:20:24,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:20:24,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:24,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 12:20:24,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:24,698 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-03-17 12:20:24,716 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:20:24,717 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 19 treesize of output 16 [2025-03-17 12:20:24,734 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:20:24,735 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 19 treesize of output 16 [2025-03-17 12:20:24,747 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:20:24,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:20:24,792 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-17 12:20:24,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 12:20:24,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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-03-17 12:20:24,828 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 12 [2025-03-17 12:20:24,854 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 17 treesize of output 12 [2025-03-17 12:20:24,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 28 treesize of output 12 [2025-03-17 12:20:24,897 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 16 treesize of output 8 [2025-03-17 12:20:24,900 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-17 12:20:24,900 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:24,913 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2025-03-17 12:20:24,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2025-03-17 12:20:24,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1212) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_1212 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1212 .cse0))))))) is different from false [2025-03-17 12:20:24,927 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 41 treesize of output 39 [2025-03-17 12:20:24,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 4 [2025-03-17 12:20:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2025-03-17 12:20:24,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361337861] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:20:24,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:20:24,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 24 [2025-03-17 12:20:24,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670131049] [2025-03-17 12:20:24,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:20:24,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-17 12:20:24,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:20:24,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-17 12:20:24,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=398, Unknown=3, NotChecked=126, Total=600 [2025-03-17 12:20:24,987 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 25 states, 25 states have (on average 3.16) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:25,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:20:25,222 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2025-03-17 12:20:25,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-17 12:20:25,223 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2025-03-17 12:20:25,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:20:25,223 INFO L225 Difference]: With dead ends: 80 [2025-03-17 12:20:25,223 INFO L226 Difference]: Without dead ends: 80 [2025-03-17 12:20:25,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=535, Unknown=3, NotChecked=150, Total=812 [2025-03-17 12:20:25,224 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:20:25,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 526 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 359 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2025-03-17 12:20:25,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-17 12:20:25,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-17 12:20:25,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 68 states have (on average 1.2794117647058822) internal successors, (87), 79 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:25,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-17 12:20:25,226 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 40 [2025-03-17 12:20:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:20:25,226 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-17 12:20:25,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.16) internal successors, (79), 24 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:20:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-17 12:20:25,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:20:25,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:20:25,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:20:25,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 12:20:25,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:25,434 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-17 12:20:25,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:20:25,434 INFO L85 PathProgramCache]: Analyzing trace with hash 23095369, now seen corresponding path program 2 times [2025-03-17 12:20:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:20:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-17 12:20:25,434 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:20:25,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 12:20:25,475 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:20:25,475 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:25,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:26,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:20:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:20:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003128665] [2025-03-17 12:20:26,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003128665] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:20:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280180915] [2025-03-17 12:20:26,392 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 12:20:26,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:20:26,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:20:26,395 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:20:26,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 12:20:26,482 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 41 statements into 2 equivalence classes. [2025-03-17 12:20:26,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:20:26,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 12:20:26,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:20:26,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-17 12:20:26,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:20:26,561 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-03-17 12:20:26,624 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:20:26,625 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 19 treesize of output 16 [2025-03-17 12:20:26,677 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-03-17 12:20:26,684 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-03-17 12:20:26,718 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 33 treesize of output 17 [2025-03-17 12:20:26,726 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 11 [2025-03-17 12:20:26,778 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-17 12:20:26,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 18 treesize of output 21 [2025-03-17 12:20:26,847 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:20:26,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 37 [2025-03-17 12:20:26,872 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-17 12:20:26,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 23 [2025-03-17 12:20:26,950 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:20:26,950 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 1 case distinctions, treesize of input 107 treesize of output 61 [2025-03-17 12:20:26,968 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-17 12:20:26,968 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 33 [2025-03-17 12:20:27,123 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-03-17 12:20:27,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 84 [2025-03-17 12:20:27,153 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-03-17 12:20:27,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 30 treesize of output 48 [2025-03-17 12:20:27,846 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2025-03-17 12:20:27,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 244 treesize of output 198 [2025-03-17 12:20:27,866 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2025-03-17 12:20:27,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 244 treesize of output 219 [2025-03-17 12:20:28,580 INFO L349 Elim1Store]: treesize reduction 142, result has 33.3 percent of original size [2025-03-17 12:20:28,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 160 [2025-03-17 12:20:28,660 INFO L349 Elim1Store]: treesize reduction 134, result has 34.6 percent of original size [2025-03-17 12:20:28,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 110 treesize of output 129 [2025-03-17 12:20:29,403 INFO L349 Elim1Store]: treesize reduction 61, result has 55.5 percent of original size [2025-03-17 12:20:29,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 179 treesize of output 210 [2025-03-17 12:20:29,516 INFO L349 Elim1Store]: treesize reduction 73, result has 61.4 percent of original size [2025-03-17 12:20:29,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 143 treesize of output 218 [2025-03-17 12:20:31,547 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:20:31,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:20:32,500 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4))) (and (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse0 (select v_ArrVal_1407 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< .cse0 0) (not (= v_ArrVal_1407 (store (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1407 .cse2)))) (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse3 (select v_ArrVal_1408 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse4 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or (= (select (select (store .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1407) .cse3) .cse0) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1408) .cse3) .cse0)) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse3) (not (= v_ArrVal_1408 (store (select .cse4 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1408 .cse2)))))))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (< .cse5 0) (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (let ((.cse6 (select (select (store .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1408) (select v_ArrVal_1408 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) .cse5))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse6) (= (select |c_#valid| .cse6) 1) (not (= v_ArrVal_1408 (store (select .cse7 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1408 .cse2)))))))))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int)) (or (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (.cse9 (select v_ArrVal_1408 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (let ((.cse8 (select (select (store .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1408) .cse9) .cse5))) (or (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse8) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| .cse9) (not (= v_ArrVal_1408 (store (select .cse10 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1408 .cse2)))))))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 0))) (forall ((|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (.cse11 (select v_ArrVal_1407 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse13 (select v_ArrVal_1408 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse14 (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)))) (or (= (select (select (store .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1407) .cse13) .cse11) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= (select |c_#valid| (select (select (store .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1408) .cse13) .cse11)) 1) (not (= v_ArrVal_1408 (store (select .cse14 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1408 .cse2))))))) (not (= v_ArrVal_1407 (store (select .cse12 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2 (select v_ArrVal_1407 .cse2)))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| .cse11)))))) is different from false [2025-03-17 12:20:58,360 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (and (forall ((v_ArrVal_1397 (Array Int Int))) (or (forall ((v_ArrVal_1396 Int) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| 0) (forall ((v_ArrVal_1401 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1402 Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (let ((.cse5 (store .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1401))) (let ((.cse6 (store (select .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|))) (let ((.cse0 (select (select (store (store .cse7 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1408) (select v_ArrVal_1408 0)) |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| .cse0) (= 0 (select (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1396)))) (store .cse2 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| (store (store (select .cse2 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|) 4 v_ArrVal_1402))))) (store .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base| (store (select .cse1 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0))) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0)) (not (= (store (select (store .cse5 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse6) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1408 4)) v_ArrVal_1408)) (not (= v_ArrVal_1401 (store (store (select .cse7 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1401 4)))) (= (select |c_#valid| .cse0) 1))))))) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))) (not (= (store .cse8 .cse4 (select v_ArrVal_1397 .cse4)) v_ArrVal_1397)))) (forall ((v_ArrVal_1397 (Array Int Int))) (or (not (= (store .cse8 .cse4 (select v_ArrVal_1397 .cse4)) v_ArrVal_1397)) (forall ((|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| Int)) (or (< |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| 0) (forall ((v_ArrVal_1401 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1408 (Array Int Int))) (let ((.cse12 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (let ((.cse10 (store .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1401))) (let ((.cse11 (store (select .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|)) (.cse13 (select v_ArrVal_1408 0))) (let ((.cse9 (select (select (store (store .cse12 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse11) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1408) .cse13) |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))) (or (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| .cse9) (not (= (store (select (store .cse10 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse11) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1408 4)) v_ArrVal_1408)) (not (= v_ArrVal_1401 (store (store (select .cse12 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1401 4)))) (= (select |c_#valid| .cse9) 1) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| .cse13))))))) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))))) (forall ((v_ArrVal_1397 (Array Int Int))) (or (not (= (store .cse8 .cse4 (select v_ArrVal_1397 .cse4)) v_ArrVal_1397)) (forall ((v_ArrVal_1396 Int) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| Int)) (or (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| Int)) (let ((.cse14 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (or (not (= v_ArrVal_1401 (store (store (select .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1401 4)))) (forall ((v_ArrVal_1402 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1396)))) (let ((.cse15 (store .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| (store (store (select .cse17 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|) 4 v_ArrVal_1402)))) (let ((.cse16 (store (select .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse19 (select v_ArrVal_1407 0))) (or (not (= v_ArrVal_1407 (store (select (store .cse15 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse16) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1407 4)))) (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse21 (store .cse14 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1401))) (let ((.cse18 (select v_ArrVal_1408 0)) (.cse20 (store (select .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|))) (or (= (select (select (store (store .cse17 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse16) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1407) .cse18) .cse19) 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1398) (select (select (store (store .cse14 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1408) .cse18) .cse19)) 1) (not (= (store (select (store .cse21 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse20) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1408 4)) v_ArrVal_1408)))))) (< .cse19 0) (= .cse19 0))))))))) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))))) (forall ((v_ArrVal_1397 (Array Int Int))) (or (not (= (store .cse8 .cse4 (select v_ArrVal_1397 .cse4)) v_ArrVal_1397)) (forall ((v_ArrVal_1396 Int) (|v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40| Int)) (or (forall ((v_ArrVal_1401 (Array Int Int)) (v_ArrVal_1398 Int) (|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| Int)) (let ((.cse27 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1397))) (or (forall ((v_ArrVal_1402 Int) (|ULTIMATE.start_sll_circular_create_~last~0#1.base| Int) (v_ArrVal_1407 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse4 v_ArrVal_1396)))) (let ((.cse22 (store .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| (store (store (select .cse24 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|) 4 v_ArrVal_1402)))) (let ((.cse23 (store (select .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0)) (.cse26 (select v_ArrVal_1407 0))) (or (not (= v_ArrVal_1407 (store (select (store .cse22 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse23) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1407 4)))) (forall ((v_ArrVal_1408 (Array Int Int))) (let ((.cse29 (store .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1401))) (let ((.cse28 (store (select .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|)) (.cse25 (select v_ArrVal_1408 0))) (or (= (select (select (store (store .cse24 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse23) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1407) .cse25) .cse26) 0) (= (select (store |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1398) (select (select (store (store .cse27 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| v_ArrVal_1408) .cse25) .cse26)) 1) (not (= (store (select (store .cse29 |ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse28) |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 4 (select v_ArrVal_1408 4)) v_ArrVal_1408)) (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52| .cse25))))) (< .cse26 0)))))) (not (= v_ArrVal_1401 (store (store (select .cse27 |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_52|) 0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 4 (select v_ArrVal_1401 4))))))) (< |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_sll_circular_create_~head~0#1.offset_40|))))))) is different from false [2025-03-17 12:20:58,773 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-03-17 12:20:58,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 9195 treesize of output 8945 [2025-03-17 12:20:58,843 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,084 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:59,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2025-03-17 12:20:59,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:59,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 6 [2025-03-17 12:20:59,680 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,701 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,709 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,716 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,719 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:20:59,908 INFO L349 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size [2025-03-17 12:20:59,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 947 treesize of output 939 [2025-03-17 12:21:00,063 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:00,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:00,136 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 41 treesize of output 57 [2025-03-17 12:21:00,550 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:00,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:00,619 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 41 treesize of output 57 [2025-03-17 12:21:03,278 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:03,692 INFO L349 Elim1Store]: treesize reduction 147, result has 32.9 percent of original size [2025-03-17 12:21:03,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 600 treesize of output 635 [2025-03-17 12:21:22,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:22,691 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:22,692 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 5204 treesize of output 4502