./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 08:00:47,831 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 08:00:47,888 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 08:00:47,892 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 08:00:47,892 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 08:00:47,906 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 08:00:47,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 08:00:47,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 08:00:47,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 08:00:47,908 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 08:00:47,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 08:00:47,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 08:00:47,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 08:00:47,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 08:00:47,909 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 08:00:47,909 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 08:00:47,909 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 08:00:47,909 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 08:00:47,910 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 08:00:47,910 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:00:47,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 08:00:47,911 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 08:00:47,911 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-04 08:00:48,114 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 08:00:48,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 08:00:48,123 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 08:00:48,124 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 08:00:48,124 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 08:00:48,126 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-04 08:00:49,246 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090448242/1bd56c2a93cf440e85384b0ea1e0efa9/FLAG3e7a165a7 [2025-03-04 08:00:49,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 08:00:49,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-03-04 08:00:49,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090448242/1bd56c2a93cf440e85384b0ea1e0efa9/FLAG3e7a165a7 [2025-03-04 08:00:49,817 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/090448242/1bd56c2a93cf440e85384b0ea1e0efa9 [2025-03-04 08:00:49,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 08:00:49,820 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 08:00:49,822 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 08:00:49,823 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 08:00:49,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 08:00:49,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:00:49" (1/1) ... [2025-03-04 08:00:49,827 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31f5b3bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:49, skipping insertion in model container [2025-03-04 08:00:49,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 08:00:49" (1/1) ... [2025-03-04 08:00:49,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 08:00:50,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:00:50,077 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 08:00:50,103 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 08:00:50,124 INFO L204 MainTranslator]: Completed translation [2025-03-04 08:00:50,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50 WrapperNode [2025-03-04 08:00:50,125 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 08:00:50,126 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 08:00:50,126 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 08:00:50,126 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 08:00:50,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,142 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,156 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-03-04 08:00:50,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 08:00:50,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 08:00:50,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 08:00:50,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 08:00:50,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,177 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-04 08:00:50,177 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,177 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,181 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,183 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,184 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 08:00:50,185 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 08:00:50,185 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 08:00:50,185 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 08:00:50,186 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (1/1) ... [2025-03-04 08:00:50,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 08:00:50,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:50,208 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 08:00:50,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-04 08:00:50,224 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 08:00:50,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 08:00:50,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 08:00:50,298 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 08:00:50,300 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 08:00:50,314 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-04 08:00:50,499 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-03-04 08:00:50,499 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 08:00:50,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 08:00:50,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 08:00:50,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:00:50 BoogieIcfgContainer [2025-03-04 08:00:50,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 08:00:50,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 08:00:50,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 08:00:50,514 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 08:00:50,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 08:00:49" (1/3) ... [2025-03-04 08:00:50,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545c5d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:00:50, skipping insertion in model container [2025-03-04 08:00:50,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 08:00:50" (2/3) ... [2025-03-04 08:00:50,518 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@545c5d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 08:00:50, skipping insertion in model container [2025-03-04 08:00:50,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 08:00:50" (3/3) ... [2025-03-04 08:00:50,519 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2025-03-04 08:00:50,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 08:00:50,529 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_circular_traversal-1.i that has 2 procedures, 74 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-03-04 08:00:50,559 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 08:00:50,567 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;@79c11c86, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 08:00:50,567 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 08:00:50,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 71 states have internal predecessors, (81), 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-04 08:00:50,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:00:50,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:50,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:00:50,575 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-04 08:00:50,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:50,578 INFO L85 PathProgramCache]: Analyzing trace with hash 3631484, now seen corresponding path program 1 times [2025-03-04 08:00:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:50,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259479063] [2025-03-04 08:00:50,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:50,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:00:50,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:00:50,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:50,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:50,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:00:50,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:50,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259479063] [2025-03-04 08:00:50,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259479063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:50,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:50,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:00:50,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605181224] [2025-03-04 08:00:50,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:50,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:00:50,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:50,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:00:50,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:50,747 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 71 states have internal predecessors, (81), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:50,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:50,814 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2025-03-04 08:00:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:00:50,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:00:50,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:50,820 INFO L225 Difference]: With dead ends: 69 [2025-03-04 08:00:50,820 INFO L226 Difference]: Without dead ends: 63 [2025-03-04 08:00:50,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:50,824 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:50,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:50,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-04 08:00:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2025-03-04 08:00:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.763157894736842) internal successors, (67), 62 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-04 08:00:50,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2025-03-04 08:00:50,845 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 4 [2025-03-04 08:00:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:50,845 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2025-03-04 08:00:50,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2025-03-04 08:00:50,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-03-04 08:00:50,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:50,846 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-03-04 08:00:50,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 08:00:50,846 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-04 08:00:50,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:50,846 INFO L85 PathProgramCache]: Analyzing trace with hash 3631485, now seen corresponding path program 1 times [2025-03-04 08:00:50,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:50,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742533144] [2025-03-04 08:00:50,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:50,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:50,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 08:00:50,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 08:00:50,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:50,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:50,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:00:50,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:50,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742533144] [2025-03-04 08:00:50,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742533144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:50,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:50,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:00:50,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138452120] [2025-03-04 08:00:50,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:50,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:00:50,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:50,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:00:50,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:50,946 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:51,002 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-03-04 08:00:51,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:00:51,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-03-04 08:00:51,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:51,003 INFO L225 Difference]: With dead ends: 60 [2025-03-04 08:00:51,003 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 08:00:51,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,004 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 12 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:51,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 90 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 08:00:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 08:00:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.6842105263157894) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-03-04 08:00:51,010 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 4 [2025-03-04 08:00:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:51,011 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-03-04 08:00:51,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-03-04 08:00:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 08:00:51,011 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:51,012 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:51,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 08:00:51,012 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-04 08:00:51,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1923770355, now seen corresponding path program 1 times [2025-03-04 08:00:51,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:51,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090964150] [2025-03-04 08:00:51,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:51,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:51,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 08:00:51,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 08:00:51,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:51,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:51,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:00:51,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:51,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090964150] [2025-03-04 08:00:51,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090964150] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:51,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:51,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:00:51,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715822520] [2025-03-04 08:00:51,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:51,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:00:51,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:51,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:00:51,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,093 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:51,138 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-03-04 08:00:51,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:00:51,138 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:51,139 INFO L225 Difference]: With dead ends: 58 [2025-03-04 08:00:51,139 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 08:00:51,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,139 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:51,139 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:00:51,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 08:00:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-03-04 08:00:51,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 38 states have (on average 1.631578947368421) 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-04 08:00:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-03-04 08:00:51,143 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 9 [2025-03-04 08:00:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:51,144 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-03-04 08:00:51,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-03-04 08:00:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 08:00:51,145 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:51,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 08:00:51,146 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-04 08:00:51,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1923770354, now seen corresponding path program 1 times [2025-03-04 08:00:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227870984] [2025-03-04 08:00:51,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:51,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 08:00:51,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 08:00:51,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:51,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:51,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:00:51,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:51,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227870984] [2025-03-04 08:00:51,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227870984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:51,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:51,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 08:00:51,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642254182] [2025-03-04 08:00:51,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:51,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:00:51,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:51,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:00:51,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,253 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:51,284 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2025-03-04 08:00:51,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:00:51,285 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:51,285 INFO L225 Difference]: With dead ends: 56 [2025-03-04 08:00:51,285 INFO L226 Difference]: Without dead ends: 56 [2025-03-04 08:00:51,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,286 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 2 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:51,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 95 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:00:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2025-03-04 08:00:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2025-03-04 08:00:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.5789473684210527) 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-04 08:00:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2025-03-04 08:00:51,289 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 9 [2025-03-04 08:00:51,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:51,289 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2025-03-04 08:00:51,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-04 08:00:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2025-03-04 08:00:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-04 08:00:51,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:51,289 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 08:00:51,289 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-04 08:00:51,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:51,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1906814610, now seen corresponding path program 1 times [2025-03-04 08:00:51,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:51,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971392373] [2025-03-04 08:00:51,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:51,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:51,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 08:00:51,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 08:00:51,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:51,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:51,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 08:00:51,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:51,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971392373] [2025-03-04 08:00:51,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971392373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:51,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:51,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 08:00:51,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329836833] [2025-03-04 08:00:51,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:51,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 08:00:51,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:51,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 08:00:51,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,357 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:51,366 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2025-03-04 08:00:51,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 08:00:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-04 08:00:51,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:51,367 INFO L225 Difference]: With dead ends: 61 [2025-03-04 08:00:51,367 INFO L226 Difference]: Without dead ends: 61 [2025-03-04 08:00:51,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 08:00:51,368 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:51,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 109 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:00:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-04 08:00:51,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2025-03-04 08:00:51,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 39 states have (on average 1.564102564102564) internal successors, (61), 56 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2025-03-04 08:00:51,374 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 11 [2025-03-04 08:00:51,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:51,374 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2025-03-04 08:00:51,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2025-03-04 08:00:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 08:00:51,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:51,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:51,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 08:00:51,375 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-04 08:00:51,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1624235837, now seen corresponding path program 1 times [2025-03-04 08:00:51,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236477330] [2025-03-04 08:00:51,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:51,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:00:51,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:00:51,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:51,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:51,457 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-04 08:00:51,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236477330] [2025-03-04 08:00:51,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236477330] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:00:51,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670465681] [2025-03-04 08:00:51,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:51,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:00:51,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:51,460 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-04 08:00:51,462 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-04 08:00:51,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 08:00:51,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 08:00:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:51,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:51,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 08:00:51,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:00:51,587 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-04 08:00:51,590 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:00:51,636 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-04 08:00:51,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670465681] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:00:51,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:00:51,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 08:00:51,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016976340] [2025-03-04 08:00:51,638 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:00:51,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 08:00:51,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:51,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 08:00:51,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:00:51,640 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:51,663 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2025-03-04 08:00:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 08:00:51,664 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-03-04 08:00:51,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:51,665 INFO L225 Difference]: With dead ends: 72 [2025-03-04 08:00:51,665 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 08:00:51,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 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-04 08:00:51,665 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 8 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:51,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 214 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 08:00:51,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 08:00:51,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 08:00:51,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 54 states have (on average 1.4074074074074074) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-03-04 08:00:51,670 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 16 [2025-03-04 08:00:51,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:51,670 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-03-04 08:00:51,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-03-04 08:00:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 08:00:51,671 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:51,671 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:51,677 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-04 08:00:51,871 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-04 08:00:51,872 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-04 08:00:51,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:51,872 INFO L85 PathProgramCache]: Analyzing trace with hash 254454830, now seen corresponding path program 2 times [2025-03-04 08:00:51,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:51,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648355893] [2025-03-04 08:00:51,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:00:51,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:51,888 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-03-04 08:00:51,905 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 08:00:51,909 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:00:51,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:52,031 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-04 08:00:52,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:52,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648355893] [2025-03-04 08:00:52,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648355893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:52,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:52,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:00:52,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343226884] [2025-03-04 08:00:52,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:52,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:00:52,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:52,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:00:52,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:00:52,034 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:52,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:52,133 INFO L93 Difference]: Finished difference Result 69 states and 74 transitions. [2025-03-04 08:00:52,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 08:00:52,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 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 31 [2025-03-04 08:00:52,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:52,135 INFO L225 Difference]: With dead ends: 69 [2025-03-04 08:00:52,135 INFO L226 Difference]: Without dead ends: 69 [2025-03-04 08:00:52,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:00:52,135 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 17 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:52,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 117 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:52,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2025-03-04 08:00:52,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2025-03-04 08:00:52,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 68 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-04 08:00:52,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2025-03-04 08:00:52,142 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 31 [2025-03-04 08:00:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:52,142 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2025-03-04 08:00:52,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:52,143 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2025-03-04 08:00:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 08:00:52,143 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:52,143 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 08:00:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 08:00:52,143 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-04 08:00:52,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 254454831, now seen corresponding path program 1 times [2025-03-04 08:00:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:52,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066175478] [2025-03-04 08:00:52,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:52,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:52,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 08:00:52,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 08:00:52,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:52,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:52,395 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-04 08:00:52,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066175478] [2025-03-04 08:00:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066175478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 08:00:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490927767] [2025-03-04 08:00:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:52,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 08:00:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:52,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 08:00:52,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 08:00:52,399 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:52,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:52,489 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2025-03-04 08:00:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 08:00:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2025-03-04 08:00:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:52,493 INFO L225 Difference]: With dead ends: 76 [2025-03-04 08:00:52,493 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 08:00:52,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 08:00:52,493 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 8 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:52,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 165 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 08:00:52,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2025-03-04 08:00:52,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-03-04 08:00:52,498 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 31 [2025-03-04 08:00:52,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:52,498 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-03-04 08:00:52,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:52,498 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-03-04 08:00:52,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 08:00:52,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:52,499 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-04 08:00:52,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 08:00:52,499 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-04 08:00:52,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:52,500 INFO L85 PathProgramCache]: Analyzing trace with hash -460909630, now seen corresponding path program 1 times [2025-03-04 08:00:52,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:52,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161601421] [2025-03-04 08:00:52,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:52,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:52,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 08:00:52,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 08:00:52,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:52,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:53,105 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-04 08:00:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161601421] [2025-03-04 08:00:53,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161601421] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:00:53,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1459052343] [2025-03-04 08:00:53,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:53,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:00:53,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:53,109 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-04 08:00:53,110 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-04 08:00:53,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 08:00:53,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 08:00:53,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:53,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:53,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 08:00:53,237 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:00:53,424 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-04 08:00:53,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 08:00:53,496 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-04 08:00:53,597 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-04 08:00:53,597 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:00:53,856 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-04 08:00:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1459052343] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:00:53,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:00:53,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-03-04 08:00:53,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825586062] [2025-03-04 08:00:53,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:00:53,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 08:00:53,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:53,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 08:00:53,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-03-04 08:00:53,859 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:54,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:54,128 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2025-03-04 08:00:54,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 08:00:54,128 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 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-04 08:00:54,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:54,128 INFO L225 Difference]: With dead ends: 72 [2025-03-04 08:00:54,128 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 08:00:54,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 08:00:54,129 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 23 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:54,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 489 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:54,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 08:00:54,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 08:00:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3103448275862069) internal successors, (76), 71 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:54,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2025-03-04 08:00:54,132 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 35 [2025-03-04 08:00:54,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:54,133 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2025-03-04 08:00:54,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.64) internal successors, (66), 25 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:54,133 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2025-03-04 08:00:54,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 08:00:54,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:54,133 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] [2025-03-04 08:00:54,142 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-04 08:00:54,337 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-04 08:00:54,337 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-04 08:00:54,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:54,337 INFO L85 PathProgramCache]: Analyzing trace with hash -488644844, now seen corresponding path program 1 times [2025-03-04 08:00:54,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:54,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529480849] [2025-03-04 08:00:54,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:54,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:54,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 08:00:54,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 08:00:54,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:54,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:54,876 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 08:00:54,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529480849] [2025-03-04 08:00:54,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529480849] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:00:54,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [521466429] [2025-03-04 08:00:54,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:54,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:00:54,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:54,879 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-04 08:00:54,881 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-04 08:00:54,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 08:00:54,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 08:00:54,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:54,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:54,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 08:00:54,991 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:00:55,010 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-04 08:00:55,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 08:00:55,039 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-04 08:00:55,064 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-04 08:00:55,075 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-04 08:00:55,122 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 08:00:55,123 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-04 08:00:55,266 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 08:00:55,266 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-04 08:00:55,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:00:55,284 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-04 08:00:55,294 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-04 08:00:55,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:00:55,493 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-04 08:00:55,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [521466429] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:00:55,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:00:55,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2025-03-04 08:00:55,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968185577] [2025-03-04 08:00:55,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:00:55,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 08:00:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:55,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 08:00:55,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-03-04 08:00:55,495 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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-04 08:00:55,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:55,899 INFO L93 Difference]: Finished difference Result 77 states and 84 transitions. [2025-03-04 08:00:55,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 08:00:55,899 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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 37 [2025-03-04 08:00:55,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:55,900 INFO L225 Difference]: With dead ends: 77 [2025-03-04 08:00:55,900 INFO L226 Difference]: Without dead ends: 77 [2025-03-04 08:00:55,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-03-04 08:00:55,901 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 25 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:55,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 272 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 08:00:55,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-04 08:00:55,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-04 08:00:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3333333333333333) internal successors, (84), 76 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2025-03-04 08:00:55,907 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 37 [2025-03-04 08:00:55,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:55,907 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2025-03-04 08:00:55,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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-04 08:00:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2025-03-04 08:00:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-04 08:00:55,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:55,907 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] [2025-03-04 08:00:55,914 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-04 08:00:56,108 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-04 08:00:56,108 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-04 08:00:56,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash -488644843, now seen corresponding path program 1 times [2025-03-04 08:00:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105123755] [2025-03-04 08:00:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:56,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 08:00:56,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 08:00:56,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:56,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:56,789 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-04 08:00:56,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105123755] [2025-03-04 08:00:56,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105123755] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:00:56,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214544004] [2025-03-04 08:00:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:00:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:00:56,792 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-04 08:00:56,793 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-04 08:00:56,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 08:00:56,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 08:00:56,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:56,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:56,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-03-04 08:00:56,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:00:56,924 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-04 08:00:56,979 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 08:00:56,980 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-04 08:00:57,023 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-04 08:00:57,029 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-04 08:00:57,064 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-04 08:00:57,071 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-04 08:00:57,131 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 08:00:57,131 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-04 08:00:57,141 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-04 08:00:57,141 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-04 08:00:57,349 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 08:00:57,349 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-04 08:00:57,354 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 08:00:57,354 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-04 08:00:57,380 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:00:57,380 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-04 08:00:57,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:00:57,387 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-04 08:00:57,466 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-04 08:00:57,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:00:58,013 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-04 08:00:58,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214544004] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:00:58,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:00:58,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2025-03-04 08:00:58,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773435350] [2025-03-04 08:00:58,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:00:58,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-04 08:00:58,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:58,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-04 08:00:58,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2025-03-04 08:00:58,016 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:58,892 INFO L93 Difference]: Finished difference Result 93 states and 102 transitions. [2025-03-04 08:00:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 08:00:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 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 37 [2025-03-04 08:00:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:58,893 INFO L225 Difference]: With dead ends: 93 [2025-03-04 08:00:58,893 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 08:00:58,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1856, Unknown=0, NotChecked=0, Total=2070 [2025-03-04 08:00:58,894 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 74 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 979 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:58,894 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 541 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 979 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 08:00:58,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 08:00:58,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-03-04 08:00:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 71 states have (on average 1.3098591549295775) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:58,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-03-04 08:00:58,901 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 37 [2025-03-04 08:00:58,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:58,901 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-03-04 08:00:58,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.4705882352941178) internal successors, (84), 35 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-03-04 08:00:58,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 08:00:58,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:58,901 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] [2025-03-04 08:00:58,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 08:00:59,102 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-04 08:00:59,102 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-04 08:00:59,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:59,102 INFO L85 PathProgramCache]: Analyzing trace with hash 2031879587, now seen corresponding path program 1 times [2025-03-04 08:00:59,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:59,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299805750] [2025-03-04 08:00:59,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:59,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:59,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 08:00:59,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 08:00:59,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:59,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:00:59,314 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-04 08:00:59,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:00:59,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299805750] [2025-03-04 08:00:59,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299805750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 08:00:59,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 08:00:59,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 08:00:59,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757072630] [2025-03-04 08:00:59,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 08:00:59,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 08:00:59,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:00:59,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 08:00:59,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 08:00:59,316 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:59,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:00:59,404 INFO L93 Difference]: Finished difference Result 93 states and 103 transitions. [2025-03-04 08:00:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 08:00:59,404 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2025-03-04 08:00:59,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:00:59,406 INFO L225 Difference]: With dead ends: 93 [2025-03-04 08:00:59,406 INFO L226 Difference]: Without dead ends: 93 [2025-03-04 08:00:59,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 08:00:59,406 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 51 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 08:00:59,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 135 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 08:00:59,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-04 08:00:59,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 84. [2025-03-04 08:00:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.2916666666666667) internal successors, (93), 83 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:59,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-03-04 08:00:59,409 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 38 [2025-03-04 08:00:59,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:00:59,409 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-03-04 08:00:59,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 8 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:00:59,409 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-03-04 08:00:59,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 08:00:59,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:00:59,410 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, 1, 1] [2025-03-04 08:00:59,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 08:00:59,410 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-04 08:00:59,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:00:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1560517720, now seen corresponding path program 1 times [2025-03-04 08:00:59,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:00:59,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227951720] [2025-03-04 08:00:59,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:00:59,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:00:59,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 08:00:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 08:00:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:00:59,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:00,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 23 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 08:01:00,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:00,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227951720] [2025-03-04 08:01:00,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227951720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:00,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955042205] [2025-03-04 08:01:00,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:00,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:00,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:00,451 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-04 08:01:00,452 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-04 08:01:00,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 08:01:00,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 08:01:00,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:00,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:00,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 08:01:00,578 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:00,583 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-04 08:01:00,637 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 08:01:00,637 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-04 08:01:00,721 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-03-04 08:01:00,722 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-04 08:01:00,802 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 08:01:00,803 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-04 08:01:00,918 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-04 08:01:01,037 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-04 08:01:01,038 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-04 08:01:01,091 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-04 08:01:01,093 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-04 08:01:01,100 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-04 08:01:01,146 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-04 08:01:01,152 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-04 08:01:01,155 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-04 08:01:01,224 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-04 08:01:01,227 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-04 08:01:01,231 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-04 08:01:01,372 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-04 08:01:01,377 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-04 08:01:01,385 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-04 08:01:01,393 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-04 08:01:01,396 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-04 08:01:01,487 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-04 08:01:01,488 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:01,656 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-04 08:01:01,662 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))) (= |c_ULTIMATE.start_main_~data_init~0#1| (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_~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_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ 4 (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_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2025-03-04 08:01:01,673 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-04 08:01:01,687 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-04 08:01:01,694 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-04 08:01:01,699 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-04 08:01:01,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:01,709 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-04 08:01:01,712 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-04 08:01:01,715 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-04 08:01:01,736 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-04 08:01:01,967 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:01,967 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-04 08:01:01,976 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:01,977 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 199 treesize of output 186 [2025-03-04 08:01:01,989 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:01,990 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 54 treesize of output 54 [2025-03-04 08:01:02,001 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:02,001 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 78 treesize of output 70 [2025-03-04 08:01:02,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:02,087 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-04 08:01:02,093 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:02,094 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-04 08:01:02,117 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-04 08:01:02,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:02,124 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-04 08:01:02,127 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 08:01:02,129 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-04 08:01:02,133 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-04 08:01:02,689 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 16 not checked. [2025-03-04 08:01:02,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955042205] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:02,689 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:02,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 48 [2025-03-04 08:01:02,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18034420] [2025-03-04 08:01:02,690 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:02,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-04 08:01:02,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:02,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-04 08:01:02,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1676, Unknown=19, NotChecked=430, Total=2256 [2025-03-04 08:01:02,692 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:03,543 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (not .cse0) (or .cse0 (and (let ((.cse1 (select .cse2 0))) (or (= (select (select |c_#memory_int#1| .cse1) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1))) (= (select .cse3 0) 0) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (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 ((.cse5 (+ 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 .cse3 .cse5 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 .cse2 .cse5 (select v_ArrVal_1033 .cse5)) v_ArrVal_1033))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35|)) (not (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2025-03-04 08:01:04,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:04,691 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2025-03-04 08:01:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 08:01:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-04 08:01:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:04,692 INFO L225 Difference]: With dead ends: 97 [2025-03-04 08:01:04,692 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 08:01:04,693 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=392, Invalid=3384, Unknown=30, NotChecked=750, Total=4556 [2025-03-04 08:01:04,694 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 43 mSDsluCounter, 810 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 1684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 363 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:04,694 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 839 Invalid, 1684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1305 Invalid, 8 Unknown, 363 Unchecked, 1.0s Time] [2025-03-04 08:01:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 08:01:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 84. [2025-03-04 08:01:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 83 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2025-03-04 08:01:04,696 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 41 [2025-03-04 08:01:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:04,697 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2025-03-04 08:01:04,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 48 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:04,697 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2025-03-04 08:01:04,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 08:01:04,698 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:04,698 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, 1, 1] [2025-03-04 08:01:04,705 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-04 08:01:04,899 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-04 08:01:04,899 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-04 08:01:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:04,900 INFO L85 PathProgramCache]: Analyzing trace with hash -629221145, now seen corresponding path program 1 times [2025-03-04 08:01:04,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:04,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915493308] [2025-03-04 08:01:04,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:04,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:04,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 08:01:04,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 08:01:04,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:04,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:05,291 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 08:01:05,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915493308] [2025-03-04 08:01:05,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915493308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:05,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068298527] [2025-03-04 08:01:05,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 08:01:05,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:05,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:05,294 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-04 08:01:05,296 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-04 08:01:05,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 08:01:05,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 08:01:05,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 08:01:05,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:05,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 08:01:05,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:05,416 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-04 08:01:05,434 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 08:01:05,434 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-04 08:01:05,450 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 08:01:05,451 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-04 08:01:05,464 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 08:01:05,464 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-04 08:01:05,493 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-04 08:01:05,493 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-04 08:01:05,512 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-04 08:01:05,528 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-04 08:01:05,554 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-04 08:01:05,606 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-04 08:01:05,610 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-04 08:01:05,612 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-04 08:01:05,612 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 08:01:05,624 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-04 08:01:05,631 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-04 08:01:05,636 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-04 08:01:05,639 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-04 08:01:05,643 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-04 08:01:05,789 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-04 08:01:05,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068298527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 08:01:05,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 08:01:05,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 27 [2025-03-04 08:01:05,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127073824] [2025-03-04 08:01:05,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 08:01:05,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 08:01:05,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 08:01:05,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 08:01:05,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=486, Unknown=3, NotChecked=138, Total=702 [2025-03-04 08:01:05,791 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 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-04 08:01:06,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 08:01:06,028 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-03-04 08:01:06,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 08:01:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 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 42 [2025-03-04 08:01:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 08:01:06,029 INFO L225 Difference]: With dead ends: 82 [2025-03-04 08:01:06,029 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 08:01:06,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 76 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=639, Unknown=3, NotChecked=162, Total=930 [2025-03-04 08:01:06,030 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 08:01:06,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 514 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 362 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2025-03-04 08:01:06,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 08:01:06,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 08:01:06,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 70 states have (on average 1.2714285714285714) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 08:01:06,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-03-04 08:01:06,032 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 42 [2025-03-04 08:01:06,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 08:01:06,032 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-03-04 08:01:06,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.962962962962963) internal successors, (80), 27 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-04 08:01:06,032 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-03-04 08:01:06,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 08:01:06,032 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 08:01:06,032 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, 1, 1] [2025-03-04 08:01:06,041 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-04 08:01:06,239 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-04 08:01:06,239 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-04 08:01:06,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 08:01:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -650064518, now seen corresponding path program 2 times [2025-03-04 08:01:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 08:01:06,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396391545] [2025-03-04 08:01:06,239 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 08:01:06,250 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 08:01:06,265 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 08:01:06,266 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:01:06,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:07,630 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 08:01:07,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 08:01:07,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396391545] [2025-03-04 08:01:07,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396391545] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 08:01:07,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478517738] [2025-03-04 08:01:07,630 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 08:01:07,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 08:01:07,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 08:01:07,632 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-04 08:01:07,633 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-04 08:01:07,712 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-03-04 08:01:07,753 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 08:01:07,754 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 08:01:07,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 08:01:07,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-03-04 08:01:07,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 08:01:07,772 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-04 08:01:07,829 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 08:01:07,829 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-04 08:01:07,860 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-04 08:01:07,897 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-04 08:01:07,943 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-04 08:01:07,943 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 26 treesize of output 29 [2025-03-04 08:01:08,003 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-03-04 08:01:08,003 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 56 treesize of output 36 [2025-03-04 08:01:08,012 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-04 08:01:08,051 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-04 08:01:08,051 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 56 treesize of output 30 [2025-03-04 08:01:08,058 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-04 08:01:08,139 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-03-04 08:01:08,139 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 52 treesize of output 53 [2025-03-04 08:01:08,151 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-04 08:01:08,151 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 22 [2025-03-04 08:01:08,782 INFO L349 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2025-03-04 08:01:08,782 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 213 treesize of output 163 [2025-03-04 08:01:08,790 INFO L349 Elim1Store]: treesize reduction 140, result has 0.7 percent of original size [2025-03-04 08:01:08,790 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 213 treesize of output 200 [2025-03-04 08:01:08,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 08:01:08,948 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 205 treesize of output 297 [2025-03-04 08:01:38,906 WARN L286 SmtUtils]: Spent 22.56s on a formula simplification. DAG size of input: 3404 DAG size of output: 1580 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-04 08:01:38,907 INFO L349 Elim1Store]: treesize reduction 4360, result has 42.1 percent of original size [2025-03-04 08:01:38,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 39 select indices, 39 select index equivalence classes, 0 disjoint index pairs (out of 741 index pairs), introduced 64 new quantified variables, introduced 780 case distinctions, treesize of input 747 treesize of output 3530