./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.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-simple/sll2c_update_all_reverse.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 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:58:57,316 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:58:57,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:58:57,380 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:58:57,381 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:58:57,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:58:57,406 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:58:57,406 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:58:57,407 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:58:57,407 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:58:57,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:58:57,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:58:57,408 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:58:57,408 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:58:57,408 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:58:57,409 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:58:57,409 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:58:57,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:58:57,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:58:57,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:58:57,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:58:57,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:58:57,412 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 -> 4fecbd384f63aa34e01807a3a6735a322a2435f1312f0df3ed763fde7f43fe0a [2025-03-04 07:58:57,637 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:58:57,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:58:57,645 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:58:57,646 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:58:57,646 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:58:57,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2025-03-04 07:58:58,825 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57809f58/40d0b147f42a4a9fbe0db5b9a2c2226a/FLAGbe1b31101 [2025-03-04 07:58:59,134 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:58:59,135 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_update_all_reverse.i [2025-03-04 07:58:59,145 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57809f58/40d0b147f42a4a9fbe0db5b9a2c2226a/FLAGbe1b31101 [2025-03-04 07:58:59,158 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a57809f58/40d0b147f42a4a9fbe0db5b9a2c2226a [2025-03-04 07:58:59,160 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:58:59,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:58:59,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:58:59,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:58:59,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:58:59,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d9788e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59, skipping insertion in model container [2025-03-04 07:58:59,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:58:59,439 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:58:59,453 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:58:59,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:58:59,526 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:58:59,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59 WrapperNode [2025-03-04 07:58:59,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:58:59,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:58:59,528 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:58:59,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:58:59,533 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,563 INFO L138 Inliner]: procedures = 126, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2025-03-04 07:58:59,566 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:58:59,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:58:59,567 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:58:59,567 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:58:59,572 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,574 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,586 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 5 writes are split as follows [0, 5]. [2025-03-04 07:58:59,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,594 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:58:59,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:58:59,600 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:58:59,600 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:58:59,601 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (1/1) ... [2025-03-04 07:58:59,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:58:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:58:59,626 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 07:58:59,629 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 07:58:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:58:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:58:59,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-04 07:58:59,647 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:58:59,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:58:59,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:58:59,743 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:58:59,744 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:58:59,988 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L611: havoc sll_circular_get_data_at_#t~mem11#1; [2025-03-04 07:59:00,020 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-04 07:59:00,040 INFO L? ?]: Removed 92 outVars from TransFormulas that were not future-live. [2025-03-04 07:59:00,040 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:59:00,051 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:59:00,052 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:59:00,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:59:00 BoogieIcfgContainer [2025-03-04 07:59:00,053 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:59:00,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:59:00,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:59:00,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:59:00,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:58:59" (1/3) ... [2025-03-04 07:59:00,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf6b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:59:00, skipping insertion in model container [2025-03-04 07:59:00,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:58:59" (2/3) ... [2025-03-04 07:59:00,062 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf6b8a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:59:00, skipping insertion in model container [2025-03-04 07:59:00,062 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:59:00" (3/3) ... [2025-03-04 07:59:00,063 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_update_all_reverse.i [2025-03-04 07:59:00,074 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:59:00,075 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_update_all_reverse.i that has 2 procedures, 82 locations, 1 initial locations, 6 loop locations, and 28 error locations. [2025-03-04 07:59:00,109 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:59:00,119 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;@5983c4b3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:59:00,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 07:59:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 50 states have (on average 1.76) internal successors, (88), 78 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:59:00,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:00,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:59:00,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:00,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:00,133 INFO L85 PathProgramCache]: Analyzing trace with hash -922827722, now seen corresponding path program 1 times [2025-03-04 07:59:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474324041] [2025-03-04 07:59:00,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:00,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:59:00,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:59:00,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:00,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:00,313 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 07:59:00,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:00,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474324041] [2025-03-04 07:59:00,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474324041] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:00,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:00,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:59:00,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388524102] [2025-03-04 07:59:00,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:00,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:00,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:00,338 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:00,340 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.76) internal successors, (88), 78 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:59:00,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:00,421 INFO L93 Difference]: Finished difference Result 79 states and 87 transitions. [2025-03-04 07:59:00,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:00,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:59:00,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:00,428 INFO L225 Difference]: With dead ends: 79 [2025-03-04 07:59:00,428 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:59:00,430 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 07:59:00,432 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 2 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:00,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 135 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:59:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 07:59:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.6808510638297873) internal successors, (79), 72 states have internal predecessors, (79), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:00,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2025-03-04 07:59:00,460 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 6 [2025-03-04 07:59:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:00,460 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2025-03-04 07:59:00,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:59:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2025-03-04 07:59:00,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:59:00,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:00,461 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:59:00,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:59:00,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:00,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:00,461 INFO L85 PathProgramCache]: Analyzing trace with hash -922827721, now seen corresponding path program 1 times [2025-03-04 07:59:00,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:00,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575271467] [2025-03-04 07:59:00,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:00,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:00,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:59:00,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:59:00,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:00,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:00,591 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 07:59:00,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:00,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575271467] [2025-03-04 07:59:00,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575271467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:00,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:00,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:59:00,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830419575] [2025-03-04 07:59:00,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:00,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:00,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:00,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:00,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:00,600 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:59:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:00,633 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-03-04 07:59:00,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:00,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:59:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:00,634 INFO L225 Difference]: With dead ends: 74 [2025-03-04 07:59:00,634 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 07:59:00,635 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 07:59:00,635 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:00,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 136 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:00,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 07:59:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 07:59:00,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 47 states have (on average 1.6382978723404256) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:00,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-03-04 07:59:00,639 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 6 [2025-03-04 07:59:00,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:00,639 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-03-04 07:59:00,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:59:00,639 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-03-04 07:59:00,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:59:00,641 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:00,641 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:00,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:59:00,641 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:00,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:00,641 INFO L85 PathProgramCache]: Analyzing trace with hash 936311375, now seen corresponding path program 1 times [2025-03-04 07:59:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923377240] [2025-03-04 07:59:00,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:00,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:59:00,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:59:00,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:00,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:00,733 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 07:59:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923377240] [2025-03-04 07:59:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923377240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:59:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981668780] [2025-03-04 07:59:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:00,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:59:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:59:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:59:00,736 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:00,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:00,745 INFO L93 Difference]: Finished difference Result 81 states and 89 transitions. [2025-03-04 07:59:00,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:59:00,746 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-03-04 07:59:00,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:00,746 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:59:00,746 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:59:00,747 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 07:59:00,747 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 153 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 07:59:00,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 153 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:00,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:59:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2025-03-04 07:59:00,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.625) internal successors, (78), 71 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2025-03-04 07:59:00,752 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 13 [2025-03-04 07:59:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:00,752 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2025-03-04 07:59:00,752 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:59:00,752 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2025-03-04 07:59:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:59:00,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:00,753 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:00,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:59:00,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:00,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:00,753 INFO L85 PathProgramCache]: Analyzing trace with hash 925931694, now seen corresponding path program 1 times [2025-03-04 07:59:00,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:00,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077002506] [2025-03-04 07:59:00,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:00,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:00,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:59:00,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:59:00,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:00,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077002506] [2025-03-04 07:59:00,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077002506] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:00,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:00,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:00,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351928760] [2025-03-04 07:59:00,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:00,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:00,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:00,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:00,858 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:00,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:00,974 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2025-03-04 07:59:00,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 07:59:00,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:00,976 INFO L225 Difference]: With dead ends: 74 [2025-03-04 07:59:00,976 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 07:59:00,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:00,976 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 2 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:00,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 261 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:00,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 07:59:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 07:59:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 70 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:00,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2025-03-04 07:59:00,981 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 22 [2025-03-04 07:59:00,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:00,981 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2025-03-04 07:59:00,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:00,981 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2025-03-04 07:59:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:59:00,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:00,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:00,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:59:00,982 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:00,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:00,982 INFO L85 PathProgramCache]: Analyzing trace with hash 925931695, now seen corresponding path program 1 times [2025-03-04 07:59:00,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768456440] [2025-03-04 07:59:00,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:00,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:00,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:59:00,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:59:00,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:00,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:01,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:01,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:01,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768456440] [2025-03-04 07:59:01,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768456440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:01,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:01,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:01,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535073668] [2025-03-04 07:59:01,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:01,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:01,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:01,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:01,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:01,166 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:01,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:01,256 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2025-03-04 07:59:01,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2025-03-04 07:59:01,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:01,258 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:59:01,258 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:59:01,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:01,258 INFO L435 NwaCegarLoop]: 72 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:01,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 283 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:01,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:59:01,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2025-03-04 07:59:01,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 69 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2025-03-04 07:59:01,265 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 22 [2025-03-04 07:59:01,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:01,265 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2025-03-04 07:59:01,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:01,265 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2025-03-04 07:59:01,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:59:01,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:01,266 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:01,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:59:01,266 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2143803341, now seen corresponding path program 1 times [2025-03-04 07:59:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511705598] [2025-03-04 07:59:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:01,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:01,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:59:01,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:59:01,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:01,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:01,483 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:01,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:01,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511705598] [2025-03-04 07:59:01,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511705598] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:01,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566515628] [2025-03-04 07:59:01,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:01,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:01,486 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 07:59:01,488 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 07:59:01,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:59:01,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:59:01,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:01,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:01,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:59:01,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:01,619 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 07:59:01,690 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:59:01,690 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 07:59:01,735 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:01,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:02,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566515628] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:02,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:02,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 17 [2025-03-04 07:59:02,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639213354] [2025-03-04 07:59:02,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:02,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:59:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:02,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:59:02,002 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:59:02,002 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:02,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:02,183 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2025-03-04 07:59:02,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:59:02,183 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2025-03-04 07:59:02,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:02,184 INFO L225 Difference]: With dead ends: 72 [2025-03-04 07:59:02,184 INFO L226 Difference]: Without dead ends: 72 [2025-03-04 07:59:02,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2025-03-04 07:59:02,184 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 2 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:02,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 470 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:02,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-04 07:59:02,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-03-04 07:59:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 48 states have (on average 1.5625) internal successors, (75), 68 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2025-03-04 07:59:02,188 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 25 [2025-03-04 07:59:02,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:02,188 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2025-03-04 07:59:02,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 13 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:02,189 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2025-03-04 07:59:02,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-04 07:59:02,189 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:02,189 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:02,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:02,393 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 07:59:02,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:02,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash -2143803340, now seen corresponding path program 1 times [2025-03-04 07:59:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485935930] [2025-03-04 07:59:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:02,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:59:02,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:59:02,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:02,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:02,680 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:02,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:02,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485935930] [2025-03-04 07:59:02,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485935930] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:02,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810234943] [2025-03-04 07:59:02,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:02,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:02,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:02,682 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 07:59:02,684 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 07:59:02,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 07:59:02,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 07:59:02,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:02,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:02,765 INFO L256 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:59:02,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:02,783 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 07:59:02,787 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 07:59:02,979 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:02,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:02,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:59:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:03,043 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:03,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810234943] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:03,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:03,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2025-03-04 07:59:03,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091017281] [2025-03-04 07:59:03,168 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:03,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:59:03,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:03,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:59:03,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:59:03,169 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:03,452 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2025-03-04 07:59:03,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 07:59:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-04 07:59:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:03,453 INFO L225 Difference]: With dead ends: 73 [2025-03-04 07:59:03,453 INFO L226 Difference]: Without dead ends: 73 [2025-03-04 07:59:03,454 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:59:03,455 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 2 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:03,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 640 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:59:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-04 07:59:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2025-03-04 07:59:03,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 48 states have (on average 1.5416666666666667) internal successors, (74), 67 states have internal predecessors, (74), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:03,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2025-03-04 07:59:03,463 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 25 [2025-03-04 07:59:03,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:03,463 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2025-03-04 07:59:03,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:03,463 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2025-03-04 07:59:03,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:59:03,464 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:03,464 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:03,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 07:59:03,665 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,SelfDestructingSolverStorable6 [2025-03-04 07:59:03,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:03,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:03,667 INFO L85 PathProgramCache]: Analyzing trace with hash 2111762800, now seen corresponding path program 1 times [2025-03-04 07:59:03,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:03,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750478497] [2025-03-04 07:59:03,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:03,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:03,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:59:03,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:59:03,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:03,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:03,812 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:59:03,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:03,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750478497] [2025-03-04 07:59:03,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750478497] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:03,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:03,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:03,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102807735] [2025-03-04 07:59:03,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:03,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:03,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:03,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:03,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:03,813 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:03,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:03,975 INFO L93 Difference]: Finished difference Result 75 states and 86 transitions. [2025-03-04 07:59:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:03,975 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-04 07:59:03,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:03,977 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:59:03,977 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:59:03,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:03,977 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 38 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:03,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 362 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:59:03,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-04 07:59:03,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 70 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:03,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 84 transitions. [2025-03-04 07:59:03,981 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 84 transitions. Word has length 30 [2025-03-04 07:59:03,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:03,981 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 84 transitions. [2025-03-04 07:59:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:03,982 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 84 transitions. [2025-03-04 07:59:03,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-04 07:59:03,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:03,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:59:03,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2111762801, now seen corresponding path program 1 times [2025-03-04 07:59:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947366350] [2025-03-04 07:59:03,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:03,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:03,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 07:59:04,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 07:59:04,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:04,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:04,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:59:04,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:04,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947366350] [2025-03-04 07:59:04,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947366350] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:04,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:04,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379215245] [2025-03-04 07:59:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:04,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:04,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:04,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:04,235 INFO L87 Difference]: Start difference. First operand 74 states and 84 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:04,381 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2025-03-04 07:59:04,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:04,381 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2025-03-04 07:59:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:04,382 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:59:04,382 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:59:04,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:04,383 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 35 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:04,383 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 419 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:04,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:59:04,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2025-03-04 07:59:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 70 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:04,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2025-03-04 07:59:04,389 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 30 [2025-03-04 07:59:04,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:04,389 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2025-03-04 07:59:04,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2025-03-04 07:59:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:59:04,390 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:04,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:04,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:59:04,390 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:04,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:04,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1039780923, now seen corresponding path program 1 times [2025-03-04 07:59:04,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:04,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302703812] [2025-03-04 07:59:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:04,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:04,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:59:04,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:59:04,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:04,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:04,456 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:04,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:04,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302703812] [2025-03-04 07:59:04,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302703812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:04,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:04,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 07:59:04,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896415167] [2025-03-04 07:59:04,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:04,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:59:04,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:04,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:59:04,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:59:04,458 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:04,473 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2025-03-04 07:59:04,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:04,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-04 07:59:04,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:04,474 INFO L225 Difference]: With dead ends: 103 [2025-03-04 07:59:04,474 INFO L226 Difference]: Without dead ends: 103 [2025-03-04 07:59:04,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:59:04,475 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:04,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 149 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-03-04 07:59:04,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2025-03-04 07:59:04,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 53 states have (on average 1.509433962264151) internal successors, (80), 72 states have internal predecessors, (80), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 84 transitions. [2025-03-04 07:59:04,481 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 84 transitions. Word has length 31 [2025-03-04 07:59:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 84 transitions. [2025-03-04 07:59:04,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 84 transitions. [2025-03-04 07:59:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:59:04,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:04,482 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:04,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:59:04,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:04,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:04,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1155347093, now seen corresponding path program 1 times [2025-03-04 07:59:04,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:04,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568726731] [2025-03-04 07:59:04,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:04,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:04,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:59:04,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:59:04,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:04,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:04,552 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:04,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:04,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568726731] [2025-03-04 07:59:04,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568726731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:04,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:04,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:59:04,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716337976] [2025-03-04 07:59:04,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:04,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:04,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:04,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:04,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:04,553 INFO L87 Difference]: Start difference. First operand 76 states and 84 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:04,586 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2025-03-04 07:59:04,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:04,586 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 33 [2025-03-04 07:59:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:04,587 INFO L225 Difference]: With dead ends: 100 [2025-03-04 07:59:04,587 INFO L226 Difference]: Without dead ends: 100 [2025-03-04 07:59:04,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:59:04,591 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 107 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:04,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 215 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:04,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-03-04 07:59:04,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2025-03-04 07:59:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 76 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:04,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2025-03-04 07:59:04,594 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 33 [2025-03-04 07:59:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:04,594 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2025-03-04 07:59:04,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2025-03-04 07:59:04,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:59:04,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:04,594 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:04,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 07:59:04,594 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:04,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:04,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1155347066, now seen corresponding path program 1 times [2025-03-04 07:59:04,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:04,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576348006] [2025-03-04 07:59:04,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:04,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:04,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:59:04,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:59:04,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:04,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:04,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:04,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576348006] [2025-03-04 07:59:04,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576348006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:04,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270600949] [2025-03-04 07:59:04,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:04,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:04,922 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 07:59:04,923 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 07:59:04,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:59:05,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:59:05,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:05,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:05,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-04 07:59:05,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:05,017 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 07:59:05,054 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:05,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:05,068 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 07:59:05,110 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:05,111 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:05,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:05,216 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:05,216 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:05,240 INFO L349 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2025-03-04 07:59:05,240 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 19 treesize of output 18 [2025-03-04 07:59:05,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_465) |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_~last~0#1.base|)) is different from false [2025-03-04 07:59:05,288 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:05,288 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 18 treesize of output 19 [2025-03-04 07:59:05,292 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 30 treesize of output 22 [2025-03-04 07:59:05,299 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 5 treesize of output 3 [2025-03-04 07:59:05,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270600949] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:05,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:05,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 22 [2025-03-04 07:59:05,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842589905] [2025-03-04 07:59:05,345 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:05,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:59:05,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:05,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:59:05,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=540, Unknown=9, NotChecked=46, Total=650 [2025-03-04 07:59:05,346 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:05,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:05,706 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2025-03-04 07:59:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:59:05,707 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2025-03-04 07:59:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:05,708 INFO L225 Difference]: With dead ends: 97 [2025-03-04 07:59:05,708 INFO L226 Difference]: Without dead ends: 97 [2025-03-04 07:59:05,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=786, Unknown=9, NotChecked=56, Total=930 [2025-03-04 07:59:05,710 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 891 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:05,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 954 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:59:05,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-03-04 07:59:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2025-03-04 07:59:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 89 states have internal predecessors, (101), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:05,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2025-03-04 07:59:05,714 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 33 [2025-03-04 07:59:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:05,715 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2025-03-04 07:59:05,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.7272727272727273) internal successors, (38), 20 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:05,715 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2025-03-04 07:59:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-04 07:59:05,715 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:05,715 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:05,727 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 07:59:05,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:05,928 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:05,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:05,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1155347065, now seen corresponding path program 1 times [2025-03-04 07:59:05,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:05,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253370242] [2025-03-04 07:59:05,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:05,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:05,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:59:05,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:59:05,945 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:05,945 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:06,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:06,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253370242] [2025-03-04 07:59:06,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253370242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:06,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584009217] [2025-03-04 07:59:06,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:06,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:06,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:06,527 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 07:59:06,529 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 07:59:06,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-04 07:59:06,617 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-04 07:59:06,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:06,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:06,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-04 07:59:06,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:06,637 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 07:59:06,640 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 07:59:06,740 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:06,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:06,759 WARN L851 $PredicateComparison]: unable to prove that (and (or (< 7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-04 07:59:06,761 WARN L873 $PredicateComparison]: unable to prove that (and (or (< 7 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse0 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse0) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse0 (select |c_#length| .cse0))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-04 07:59:06,785 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 07:59:06,791 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 07:59:06,820 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:06,821 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:59:06,824 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 24 treesize of output 11 [2025-03-04 07:59:06,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:06,941 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 07:59:06,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:06,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:07,147 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_553) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_552 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)))) is different from false [2025-03-04 07:59:07,166 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_552 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_553 (Array Int Int)) (v_ArrVal_552 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_552) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_553) |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 07:59:07,173 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:07,173 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 37 treesize of output 38 [2025-03-04 07:59:07,181 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:07,181 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 29 treesize of output 30 [2025-03-04 07:59:07,185 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 52 treesize of output 44 [2025-03-04 07:59:07,188 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 82 treesize of output 70 [2025-03-04 07:59:07,196 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 9 [2025-03-04 07:59:07,199 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 9 treesize of output 7 [2025-03-04 07:59:07,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:07,205 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2025-03-04 07:59:07,207 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:07,209 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 18 treesize of output 10 [2025-03-04 07:59:07,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584009217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:07,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 24 [2025-03-04 07:59:07,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379590657] [2025-03-04 07:59:07,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:07,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-04 07:59:07,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:07,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-04 07:59:07,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=974, Unknown=4, NotChecked=192, Total=1260 [2025-03-04 07:59:07,357 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:07,534 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (< 7 .cse0) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2025-03-04 07:59:07,536 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) (and (or (< 7 .cse0) (exists ((|v_#length_BEFORE_CALL_4| (Array Int Int))) (let ((.cse1 (@diff |v_#length_BEFORE_CALL_4| |c_#length|))) (and (<= 8 (select |v_#length_BEFORE_CALL_4| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| .cse1) (= |c_#length| (store |v_#length_BEFORE_CALL_4| .cse1 (select |c_#length| .cse1))))))) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (<= 8 .cse0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2025-03-04 07:59:07,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:07,854 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2025-03-04 07:59:07,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:59:07,855 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-03-04 07:59:07,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:07,855 INFO L225 Difference]: With dead ends: 96 [2025-03-04 07:59:07,855 INFO L226 Difference]: Without dead ends: 96 [2025-03-04 07:59:07,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1293, Unknown=6, NotChecked=300, Total=1722 [2025-03-04 07:59:07,856 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 8 mSDsluCounter, 915 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:07,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 979 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 717 Invalid, 0 Unknown, 119 Unchecked, 0.4s Time] [2025-03-04 07:59:07,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-03-04 07:59:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 93. [2025-03-04 07:59:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.434782608695652) internal successors, (99), 88 states have internal predecessors, (99), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2025-03-04 07:59:07,863 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 33 [2025-03-04 07:59:07,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:07,864 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2025-03-04 07:59:07,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.625) internal successors, (39), 21 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:07,864 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2025-03-04 07:59:07,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-04 07:59:07,866 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:07,866 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 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 07:59:07,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:59:08,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:08,067 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:08,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:08,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1417975157, now seen corresponding path program 1 times [2025-03-04 07:59:08,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:08,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322528458] [2025-03-04 07:59:08,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:08,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:08,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:59:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:59:08,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:08,129 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:08,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:08,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322528458] [2025-03-04 07:59:08,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322528458] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:08,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460694128] [2025-03-04 07:59:08,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:08,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:08,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:08,132 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 07:59:08,133 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 07:59:08,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 07:59:08,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 07:59:08,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:08,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:08,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:59:08,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:08,254 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:08,255 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:08,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460694128] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:08,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:08,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-04 07:59:08,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899367958] [2025-03-04 07:59:08,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:08,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:59:08,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:08,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:59:08,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:59:08,256 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:08,288 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2025-03-04 07:59:08,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:08,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2025-03-04 07:59:08,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:08,289 INFO L225 Difference]: With dead ends: 113 [2025-03-04 07:59:08,289 INFO L226 Difference]: Without dead ends: 113 [2025-03-04 07:59:08,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:08,289 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:08,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 215 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:08,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-04 07:59:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 93. [2025-03-04 07:59:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 88 states have internal predecessors, (97), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 103 transitions. [2025-03-04 07:59:08,292 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 103 transitions. Word has length 35 [2025-03-04 07:59:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:08,293 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 103 transitions. [2025-03-04 07:59:08,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 103 transitions. [2025-03-04 07:59:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-04 07:59:08,294 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:08,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:08,300 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 07:59:08,494 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,SelfDestructingSolverStorable13 [2025-03-04 07:59:08,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1581722768, now seen corresponding path program 1 times [2025-03-04 07:59:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:08,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534074217] [2025-03-04 07:59:08,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:08,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:59:08,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:08,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:08,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:59:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534074217] [2025-03-04 07:59:08,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534074217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:08,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031516739] [2025-03-04 07:59:08,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:08,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:08,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:08,552 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 07:59:08,554 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 07:59:08,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 07:59:08,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 07:59:08,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:08,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:08,660 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 07:59:08,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:08,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:59:08,692 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:08,763 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:59:08,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031516739] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:08,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-04 07:59:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412499374] [2025-03-04 07:59:08,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:08,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:59:08,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:08,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:59:08,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:08,766 INFO L87 Difference]: Start difference. First operand 93 states and 103 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:08,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:08,792 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2025-03-04 07:59:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 07:59:08,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2025-03-04 07:59:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:08,793 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:59:08,793 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 07:59:08,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:59:08,794 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 127 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:08,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 229 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:08,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 07:59:08,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2025-03-04 07:59:08,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 100 states have internal predecessors, (117), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 123 transitions. [2025-03-04 07:59:08,799 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 123 transitions. Word has length 38 [2025-03-04 07:59:08,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:08,799 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 123 transitions. [2025-03-04 07:59:08,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:08,799 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 123 transitions. [2025-03-04 07:59:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:59:08,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:08,802 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:08,812 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 07:59:09,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:59:09,006 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:09,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:09,006 INFO L85 PathProgramCache]: Analyzing trace with hash 707278382, now seen corresponding path program 1 times [2025-03-04 07:59:09,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:09,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42443040] [2025-03-04 07:59:09,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:09,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:09,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:59:09,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:59:09,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:09,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:09,078 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:09,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42443040] [2025-03-04 07:59:09,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42443040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:09,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802873714] [2025-03-04 07:59:09,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:09,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:09,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:09,082 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 07:59:09,083 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 07:59:09,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:59:09,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:59:09,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:09,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:09,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:59:09,183 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:09,213 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:09,213 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:09,245 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:09,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802873714] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:09,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:09,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 07:59:09,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859876863] [2025-03-04 07:59:09,246 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:09,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:59:09,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:09,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:59:09,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:59:09,247 INFO L87 Difference]: Start difference. First operand 105 states and 123 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:09,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:09,283 INFO L93 Difference]: Finished difference Result 106 states and 115 transitions. [2025-03-04 07:59:09,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:09,284 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2025-03-04 07:59:09,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:09,284 INFO L225 Difference]: With dead ends: 106 [2025-03-04 07:59:09,284 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 07:59:09,284 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:09,285 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 189 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:09,285 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 347 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:09,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 07:59:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2025-03-04 07:59:09,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 76 states have (on average 1.394736842105263) internal successors, (106), 93 states have internal predecessors, (106), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 112 transitions. [2025-03-04 07:59:09,287 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 112 transitions. Word has length 40 [2025-03-04 07:59:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:09,287 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 112 transitions. [2025-03-04 07:59:09,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:09,287 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 112 transitions. [2025-03-04 07:59:09,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:59:09,288 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:09,288 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 07:59:09,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:59:09,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:09,492 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:09,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1858711182, now seen corresponding path program 2 times [2025-03-04 07:59:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:09,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828774255] [2025-03-04 07:59:09,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:09,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:09,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 07:59:09,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 21 of 42 statements. [2025-03-04 07:59:09,506 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:59:09,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:09,573 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:09,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:09,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828774255] [2025-03-04 07:59:09,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828774255] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:09,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:09,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:09,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242098218] [2025-03-04 07:59:09,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:09,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:09,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:09,575 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:09,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:09,575 INFO L87 Difference]: Start difference. First operand 98 states and 112 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:09,708 INFO L93 Difference]: Finished difference Result 104 states and 124 transitions. [2025-03-04 07:59:09,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:09,709 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-04 07:59:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:09,709 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:59:09,709 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:59:09,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:09,710 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:09,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 354 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:09,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:59:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 07:59:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 99 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 124 transitions. [2025-03-04 07:59:09,712 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 124 transitions. Word has length 42 [2025-03-04 07:59:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:09,712 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 124 transitions. [2025-03-04 07:59:09,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 124 transitions. [2025-03-04 07:59:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 07:59:09,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:09,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 07:59:09,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:59:09,713 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:09,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1858711183, now seen corresponding path program 1 times [2025-03-04 07:59:09,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:09,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579410526] [2025-03-04 07:59:09,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:09,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:09,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 07:59:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 07:59:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:09,908 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-04 07:59:09,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:09,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579410526] [2025-03-04 07:59:09,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579410526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:09,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:09,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:09,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972534262] [2025-03-04 07:59:09,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:09,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:09,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:09,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:09,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:09,910 INFO L87 Difference]: Start difference. First operand 104 states and 124 transitions. Second operand has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:10,036 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2025-03-04 07:59:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2025-03-04 07:59:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:10,037 INFO L225 Difference]: With dead ends: 104 [2025-03-04 07:59:10,037 INFO L226 Difference]: Without dead ends: 104 [2025-03-04 07:59:10,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:10,037 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 353 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:10,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 411 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-04 07:59:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-03-04 07:59:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.3902439024390243) internal successors, (114), 99 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:10,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2025-03-04 07:59:10,040 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 42 [2025-03-04 07:59:10,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:10,040 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2025-03-04 07:59:10,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.7777777777777777) internal successors, (34), 9 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:10,041 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2025-03-04 07:59:10,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:10,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:10,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:10,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 07:59:10,042 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:10,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:10,042 INFO L85 PathProgramCache]: Analyzing trace with hash -798088854, now seen corresponding path program 2 times [2025-03-04 07:59:10,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:10,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772339433] [2025-03-04 07:59:10,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:10,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:10,056 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 07:59:10,066 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:10,068 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:10,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:10,133 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 07:59:10,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772339433] [2025-03-04 07:59:10,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772339433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:10,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522749133] [2025-03-04 07:59:10,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:10,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:10,135 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:10,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:59:10,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-03-04 07:59:10,268 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:10,268 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:10,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:10,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:59:10,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:10,293 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:10,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:10,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522749133] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:10,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:10,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 07:59:10,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020169548] [2025-03-04 07:59:10,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:10,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:59:10,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:10,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:59:10,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:10,295 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:10,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:10,303 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2025-03-04 07:59:10,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:59:10,303 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-03-04 07:59:10,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:10,304 INFO L225 Difference]: With dead ends: 88 [2025-03-04 07:59:10,304 INFO L226 Difference]: Without dead ends: 88 [2025-03-04 07:59:10,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:59:10,304 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:10,304 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:10,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-03-04 07:59:10,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-03-04 07:59:10,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 69 states have (on average 1.4057971014492754) internal successors, (97), 84 states have internal predecessors, (97), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:10,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 101 transitions. [2025-03-04 07:59:10,306 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 101 transitions. Word has length 45 [2025-03-04 07:59:10,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:10,307 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 101 transitions. [2025-03-04 07:59:10,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:10,307 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 101 transitions. [2025-03-04 07:59:10,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:10,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:10,307 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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 07:59:10,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:10,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:10,512 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:10,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:10,513 INFO L85 PathProgramCache]: Analyzing trace with hash 2146460929, now seen corresponding path program 1 times [2025-03-04 07:59:10,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:10,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99283969] [2025-03-04 07:59:10,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:10,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:10,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:10,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:10,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:10,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:10,599 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-04 07:59:10,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99283969] [2025-03-04 07:59:10,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99283969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:10,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210000354] [2025-03-04 07:59:10,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:10,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:10,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:10,613 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:10,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:59:10,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:10,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:10,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:10,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:10,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:59:10,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:10,769 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 07:59:10,769 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:59:10,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210000354] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:10,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:59:10,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 7 [2025-03-04 07:59:10,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183326756] [2025-03-04 07:59:10,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:10,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:59:10,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:10,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:59:10,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:10,770 INFO L87 Difference]: Start difference. First operand 88 states and 101 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:10,801 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2025-03-04 07:59:10,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2025-03-04 07:59:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:10,801 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:59:10,801 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:59:10,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:10,802 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 63 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:10,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 175 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:59:10,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2025-03-04 07:59:10,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.328358208955224) internal successors, (89), 80 states have internal predecessors, (89), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2025-03-04 07:59:10,805 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 45 [2025-03-04 07:59:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:10,806 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2025-03-04 07:59:10,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2025-03-04 07:59:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:10,807 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:10,807 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:10,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:59:11,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:11,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:11,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:11,008 INFO L85 PathProgramCache]: Analyzing trace with hash 2146460956, now seen corresponding path program 1 times [2025-03-04 07:59:11,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:11,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012958263] [2025-03-04 07:59:11,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:11,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:11,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:11,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:11,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:11,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:11,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012958263] [2025-03-04 07:59:11,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012958263] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:11,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449385483] [2025-03-04 07:59:11,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:11,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:11,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:11,629 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:11,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:59:11,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:11,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:11,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:11,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:11,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-04 07:59:11,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:11,767 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 07:59:11,855 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:11,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:11,904 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 07:59:11,962 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:11,962 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:12,160 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:12,161 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:12,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:12,222 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 37 treesize of output 17 [2025-03-04 07:59:12,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:12,274 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:59:12,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:12,295 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1269 (Array Int Int))) (or (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1269) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1) (not (= v_ArrVal_1269 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1269 .cse0))))))) is different from false [2025-03-04 07:59:12,343 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1268) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-03-04 07:59:12,387 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset|) v_ArrVal_1268) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) 1)) is different from false [2025-03-04 07:59:12,434 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) 1)) is different from false [2025-03-04 07:59:12,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (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|) v_ArrVal_1268) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) 1)) is different from false [2025-03-04 07:59:12,447 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 07:59:12,447 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 29 treesize of output 28 [2025-03-04 07:59:12,450 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1267 (Array Int Int))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_1268)) |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 07:59:12,457 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1268 (Array Int Int)) (v_ArrVal_1267 (Array Int Int))) (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1267))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_1268)) |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_~last~0#1.base|)) is different from false [2025-03-04 07:59:12,461 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:12,461 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 36 treesize of output 29 [2025-03-04 07:59:12,468 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 136 treesize of output 112 [2025-03-04 07:59:12,471 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 52 treesize of output 48 [2025-03-04 07:59:12,473 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 26 treesize of output 20 [2025-03-04 07:59:12,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449385483] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:12,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:12,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 22] total 38 [2025-03-04 07:59:12,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085764207] [2025-03-04 07:59:12,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:12,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-04 07:59:12,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:12,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-04 07:59:12,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1574, Unknown=40, NotChecked=602, Total=2352 [2025-03-04 07:59:12,529 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:13,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:13,076 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2025-03-04 07:59:13,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:59:13,077 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2025-03-04 07:59:13,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:13,077 INFO L225 Difference]: With dead ends: 83 [2025-03-04 07:59:13,077 INFO L226 Difference]: Without dead ends: 83 [2025-03-04 07:59:13,078 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=201, Invalid=2236, Unknown=41, NotChecked=714, Total=3192 [2025-03-04 07:59:13,078 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 28 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:13,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1151 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:59:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2025-03-04 07:59:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2025-03-04 07:59:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 79 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:13,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2025-03-04 07:59:13,080 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 45 [2025-03-04 07:59:13,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:13,081 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2025-03-04 07:59:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 35 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:59:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2025-03-04 07:59:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:59:13,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:13,082 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:13,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:59:13,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:59:13,283 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:13,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:13,283 INFO L85 PathProgramCache]: Analyzing trace with hash 2146460957, now seen corresponding path program 1 times [2025-03-04 07:59:13,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969916743] [2025-03-04 07:59:13,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:13,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:13,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:13,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:13,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:13,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:14,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969916743] [2025-03-04 07:59:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969916743] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077575656] [2025-03-04 07:59:14,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:14,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:14,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:14,139 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:14,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:59:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 07:59:14,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 07:59:14,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:14,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:14,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 83 conjuncts are in the unsatisfiable core [2025-03-04 07:59:14,279 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:14,283 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 07:59:14,422 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:14,422 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:14,468 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 07:59:14,532 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:14,532 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 07:59:14,715 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:14,715 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 51 [2025-03-04 07:59:14,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 26 [2025-03-04 07:59:14,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:14,813 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 43 treesize of output 23 [2025-03-04 07:59:14,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:14,818 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 44 treesize of output 24 [2025-03-04 07:59:14,876 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 31 treesize of output 19 [2025-03-04 07:59:14,879 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 28 treesize of output 16 [2025-03-04 07:59:14,945 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:59:14,945 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:15,059 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (and (forall ((v_ArrVal_1380 (Array Int Int))) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 5)) (not (= (store .cse0 .cse1 (select v_ArrVal_1380 .cse1)) v_ArrVal_1380)))) (forall ((v_ArrVal_1380 (Array Int Int))) (or (forall ((v_ArrVal_1379 (Array Int Int))) (or (not (= v_ArrVal_1379 (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse1 (select v_ArrVal_1379 .cse1)))) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1380) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 7) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1379) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))))) (not (= (store .cse0 .cse1 (select v_ArrVal_1380 .cse1)) v_ArrVal_1380)))))) is different from false [2025-03-04 07:59:15,176 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:15,176 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 42 treesize of output 46 [2025-03-04 07:59:15,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:15,314 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 105 treesize of output 96 [2025-03-04 07:59:15,320 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 75 treesize of output 73 [2025-03-04 07:59:15,322 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 73 treesize of output 71 [2025-03-04 07:59:15,376 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (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_1376) |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 07:59:15,380 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1376 (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_1376) |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 07:59:15,384 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:15,384 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 19 treesize of output 20 [2025-03-04 07:59:15,386 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 33 treesize of output 25 [2025-03-04 07:59:15,387 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 07:59:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 4 not checked. [2025-03-04 07:59:15,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077575656] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:15,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:15,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 61 [2025-03-04 07:59:15,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976816751] [2025-03-04 07:59:15,662 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:15,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-03-04 07:59:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:15,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-03-04 07:59:15,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=3246, Unknown=3, NotChecked=348, Total=3782 [2025-03-04 07:59:15,664 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 62 states, 61 states have (on average 1.721311475409836) internal successors, (105), 53 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:16,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:16,660 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-03-04 07:59:16,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:59:16,661 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 1.721311475409836) internal successors, (105), 53 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2025-03-04 07:59:16,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:16,661 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:59:16,661 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:59:16,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 50 SyntacticMatches, 6 SemanticMatches, 70 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=279, Invalid=4422, Unknown=3, NotChecked=408, Total=5112 [2025-03-04 07:59:16,664 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 73 mSDsluCounter, 1408 mSDsCounter, 0 mSdLazyCounter, 992 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1457 SdHoareTripleChecker+Invalid, 1135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:16,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1457 Invalid, 1135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 992 Invalid, 0 Unknown, 135 Unchecked, 0.5s Time] [2025-03-04 07:59:16,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:59:16,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2025-03-04 07:59:16,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 76 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:16,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2025-03-04 07:59:16,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 45 [2025-03-04 07:59:16,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:16,666 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2025-03-04 07:59:16,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 1.721311475409836) internal successors, (105), 53 states have internal predecessors, (105), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:59:16,666 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2025-03-04 07:59:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-03-04 07:59:16,666 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:16,666 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:16,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:16,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:59:16,867 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:16,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash -187796315, now seen corresponding path program 1 times [2025-03-04 07:59:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:16,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146197114] [2025-03-04 07:59:16,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:16,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 07:59:16,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 07:59:16,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:16,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-04 07:59:16,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:16,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146197114] [2025-03-04 07:59:16,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146197114] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:16,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:16,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:59:16,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180153628] [2025-03-04 07:59:16,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:16,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 07:59:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:16,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 07:59:16,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:59:16,940 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:16,967 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2025-03-04 07:59:16,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:16,968 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 48 [2025-03-04 07:59:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:16,968 INFO L225 Difference]: With dead ends: 84 [2025-03-04 07:59:16,968 INFO L226 Difference]: Without dead ends: 84 [2025-03-04 07:59:16,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:59:16,969 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:16,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 183 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-04 07:59:16,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-04 07:59:16,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2025-03-04 07:59:16,972 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 48 [2025-03-04 07:59:16,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:16,973 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2025-03-04 07:59:16,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2025-03-04 07:59:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-04 07:59:16,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:16,973 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:16,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 07:59:16,974 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:16,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2097067816, now seen corresponding path program 1 times [2025-03-04 07:59:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741621568] [2025-03-04 07:59:16,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:16,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:16,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:17,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:17,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:17,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:59:18,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:18,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741621568] [2025-03-04 07:59:18,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741621568] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:18,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119342718] [2025-03-04 07:59:18,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:18,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:18,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:18,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:59:18,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 07:59:18,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 07:59:18,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:18,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:18,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 106 conjuncts are in the unsatisfiable core [2025-03-04 07:59:18,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:18,845 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 07:59:19,000 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:19,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:19,050 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 07:59:19,119 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:19,120 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 07:59:19,355 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:19,355 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 59 [2025-03-04 07:59:19,358 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 25 treesize of output 17 [2025-03-04 07:59:19,363 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 34 treesize of output 21 [2025-03-04 07:59:19,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:19,469 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 45 treesize of output 25 [2025-03-04 07:59:19,475 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 26 treesize of output 21 [2025-03-04 07:59:19,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:19,479 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 37 treesize of output 21 [2025-03-04 07:59:19,561 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 33 treesize of output 21 [2025-03-04 07:59:19,563 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 21 treesize of output 13 [2025-03-04 07:59:19,670 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-04 07:59:19,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:19,823 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1545 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (or (not (= (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1546 .cse0)) v_ArrVal_1546)) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_1547 .cse0)) v_ArrVal_1547)) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1545) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1547) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_1546) |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) 4)) 1))))) is different from false [2025-03-04 07:59:19,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1545 (Array Int Int))) (= (* |c_ULTIMATE.start_main_~len~0#1| 2) (+ (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~s~0#1.base| v_ArrVal_1545) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|))) 1))) is different from false [2025-03-04 07:59:19,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:19,928 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 40 treesize of output 41 [2025-03-04 07:59:19,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:19,934 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 79 treesize of output 78 [2025-03-04 07:59:19,937 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 29 treesize of output 18 [2025-03-04 07:59:20,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:20,109 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 38 treesize of output 37 [2025-03-04 07:59:20,112 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 13 treesize of output 11 [2025-03-04 07:59:20,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:20,373 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 19 treesize of output 20 [2025-03-04 07:59:20,375 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 33 treesize of output 25 [2025-03-04 07:59:20,378 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 07:59:20,652 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2025-03-04 07:59:20,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119342718] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:20,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:20,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 29, 30] total 82 [2025-03-04 07:59:20,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253458676] [2025-03-04 07:59:20,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:20,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2025-03-04 07:59:20,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:20,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2025-03-04 07:59:20,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=5962, Unknown=69, NotChecked=314, Total=6642 [2025-03-04 07:59:20,655 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 82 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 73 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:59:21,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:21,980 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2025-03-04 07:59:21,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-04 07:59:21,981 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 73 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2025-03-04 07:59:21,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:21,982 INFO L225 Difference]: With dead ends: 80 [2025-03-04 07:59:21,982 INFO L226 Difference]: Without dead ends: 80 [2025-03-04 07:59:21,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 54 SyntacticMatches, 2 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2846 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=470, Invalid=8211, Unknown=69, NotChecked=370, Total=9120 [2025-03-04 07:59:21,984 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 132 mSDsluCounter, 1884 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1927 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:21,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1927 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1651 Invalid, 0 Unknown, 157 Unchecked, 0.7s Time] [2025-03-04 07:59:21,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-03-04 07:59:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-03-04 07:59:21,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 65 states have (on average 1.2461538461538462) internal successors, (81), 76 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:21,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-03-04 07:59:21,987 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 51 [2025-03-04 07:59:21,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:21,987 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-03-04 07:59:21,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 73 states have internal predecessors, (123), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-03-04 07:59:21,987 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-03-04 07:59:21,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:59:21,988 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:21,988 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:21,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:22,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-03-04 07:59:22,190 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:22,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:22,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1444687493, now seen corresponding path program 1 times [2025-03-04 07:59:22,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:22,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564209366] [2025-03-04 07:59:22,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:22,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:22,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:22,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:22,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:22,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:22,794 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-04 07:59:22,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564209366] [2025-03-04 07:59:22,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564209366] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:22,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [914425496] [2025-03-04 07:59:22,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:22,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:22,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:22,797 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:22,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:59:22,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:22,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:22,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:22,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:22,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 07:59:22,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:22,999 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 17 treesize of output 13 [2025-03-04 07:59:23,103 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 30 treesize of output 12 [2025-03-04 07:59:23,156 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:23,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:23,234 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 38 treesize of output 32 [2025-03-04 07:59:23,259 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:23,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [914425496] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:23,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:23,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 12, 12] total 33 [2025-03-04 07:59:23,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114994678] [2025-03-04 07:59:23,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 07:59:23,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 07:59:23,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 07:59:23,261 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 33 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 32 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:23,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:23,603 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2025-03-04 07:59:23,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:59:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 32 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 57 [2025-03-04 07:59:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:23,603 INFO L225 Difference]: With dead ends: 86 [2025-03-04 07:59:23,603 INFO L226 Difference]: Without dead ends: 86 [2025-03-04 07:59:23,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=1434, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 07:59:23,604 INFO L435 NwaCegarLoop]: 57 mSDtfsCounter, 112 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:23,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1116 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:59:23,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-04 07:59:23,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2025-03-04 07:59:23,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 80 states have internal predecessors, (85), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2025-03-04 07:59:23,606 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 57 [2025-03-04 07:59:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:23,606 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2025-03-04 07:59:23,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.1515151515151514) internal successors, (104), 32 states have internal predecessors, (104), 2 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:23,606 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2025-03-04 07:59:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:59:23,606 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:23,606 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:23,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:23,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-03-04 07:59:23,807 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:23,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:23,807 INFO L85 PathProgramCache]: Analyzing trace with hash -1444601131, now seen corresponding path program 1 times [2025-03-04 07:59:23,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:23,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526296959] [2025-03-04 07:59:23,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:23,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:23,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:23,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:23,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:23,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:59:23,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:23,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526296959] [2025-03-04 07:59:23,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526296959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:23,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573985703] [2025-03-04 07:59:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:23,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:23,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:23,975 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,081 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-03-04 07:59:24,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:24,082 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-04 07:59:24,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,082 INFO L225 Difference]: With dead ends: 82 [2025-03-04 07:59:24,082 INFO L226 Difference]: Without dead ends: 82 [2025-03-04 07:59:24,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:24,083 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 300 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:24,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-03-04 07:59:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-03-04 07:59:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 78 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2025-03-04 07:59:24,087 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 57 [2025-03-04 07:59:24,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,088 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2025-03-04 07:59:24,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,088 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2025-03-04 07:59:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-04 07:59:24,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,088 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 07:59:24,088 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:24,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1444601132, now seen corresponding path program 1 times [2025-03-04 07:59:24,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917997414] [2025-03-04 07:59:24,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 07:59:24,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 07:59:24,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,184 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:59:24,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917997414] [2025-03-04 07:59:24,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917997414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:24,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:24,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:24,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103741898] [2025-03-04 07:59:24,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:24,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:24,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:24,185 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,305 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2025-03-04 07:59:24,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:24,306 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2025-03-04 07:59:24,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,306 INFO L225 Difference]: With dead ends: 95 [2025-03-04 07:59:24,306 INFO L226 Difference]: Without dead ends: 95 [2025-03-04 07:59:24,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:24,307 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 20 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 257 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:24,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-03-04 07:59:24,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2025-03-04 07:59:24,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 81 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2025-03-04 07:59:24,311 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 57 [2025-03-04 07:59:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,311 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2025-03-04 07:59:24,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2025-03-04 07:59:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:59:24,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,312 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 07:59:24,312 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:24,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1832961821, now seen corresponding path program 1 times [2025-03-04 07:59:24,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128777307] [2025-03-04 07:59:24,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:24,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:59:24,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:59:24,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:24,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,395 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:59:24,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128777307] [2025-03-04 07:59:24,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128777307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:24,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:24,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 07:59:24,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858454436] [2025-03-04 07:59:24,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:24,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:24,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:24,397 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,465 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2025-03-04 07:59:24,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:24,465 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 58 [2025-03-04 07:59:24,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,466 INFO L225 Difference]: With dead ends: 85 [2025-03-04 07:59:24,466 INFO L226 Difference]: Without dead ends: 85 [2025-03-04 07:59:24,467 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:24,467 INFO L435 NwaCegarLoop]: 44 mSDtfsCounter, 21 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 354 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:24,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-04 07:59:24,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2025-03-04 07:59:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 81 states have internal predecessors, (87), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2025-03-04 07:59:24,473 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 58 [2025-03-04 07:59:24,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,473 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2025-03-04 07:59:24,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:24,473 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2025-03-04 07:59:24,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:59:24,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,474 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 07:59:24,474 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:24,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:24,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1677702210, now seen corresponding path program 2 times [2025-03-04 07:59:24,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:24,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612979557] [2025-03-04 07:59:24,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:24,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:24,485 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:59:24,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:24,495 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:24,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:59:24,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612979557] [2025-03-04 07:59:24,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612979557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:24,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300568934] [2025-03-04 07:59:24,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:59:24,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:24,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:24,549 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:24,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:59:24,674 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 60 statements into 2 equivalence classes. [2025-03-04 07:59:24,713 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:24,713 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:59:24,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:24,714 INFO L256 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:59:24,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:24,754 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:59:24,754 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:24,798 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 07:59:24,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300568934] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:24,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:24,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-03-04 07:59:24,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983722571] [2025-03-04 07:59:24,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:24,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:59:24,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:24,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:59:24,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:59:24,799 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:24,834 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2025-03-04 07:59:24,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:59:24,834 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-03-04 07:59:24,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:24,835 INFO L225 Difference]: With dead ends: 74 [2025-03-04 07:59:24,835 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 07:59:24,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 115 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:59:24,836 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 56 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:24,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 230 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:59:24,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 07:59:24,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-04 07:59:24,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 63 states have (on average 1.1904761904761905) internal successors, (75), 70 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:24,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2025-03-04 07:59:24,838 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2025-03-04 07:59:24,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:24,838 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2025-03-04 07:59:24,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 8 states have internal predecessors, (73), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:24,841 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2025-03-04 07:59:24,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:59:24,841 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:24,841 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:24,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:59:25,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:25,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:25,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:25,043 INFO L85 PathProgramCache]: Analyzing trace with hash -540018552, now seen corresponding path program 1 times [2025-03-04 07:59:25,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:25,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878057378] [2025-03-04 07:59:25,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:25,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:25,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:25,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:25,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:25,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:25,154 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 07:59:25,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878057378] [2025-03-04 07:59:25,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878057378] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:25,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065422506] [2025-03-04 07:59:25,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:25,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:25,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:25,156 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:25,158 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:59:25,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:25,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:25,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:25,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:25,382 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 07:59:25,385 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:25,386 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 07:59:25,467 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:25,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:25,501 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 07:59:25,544 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:25,545 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:25,690 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:25,691 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:25,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:25,735 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 37 treesize of output 17 [2025-03-04 07:59:25,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:25,831 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:59:25,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:26,163 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 07:59:26,164 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 29 treesize of output 28 [2025-03-04 07:59:26,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:26,231 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 36 treesize of output 29 [2025-03-04 07:59:26,241 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 136 treesize of output 112 [2025-03-04 07:59:26,247 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 52 treesize of output 48 [2025-03-04 07:59:26,249 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 26 treesize of output 20 [2025-03-04 07:59:26,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065422506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:26,348 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:26,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 22] total 27 [2025-03-04 07:59:26,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909902059] [2025-03-04 07:59:26,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:26,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:59:26,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:26,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:59:26,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1590, Unknown=11, NotChecked=0, Total=1722 [2025-03-04 07:59:26,349 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:26,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:26,749 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2025-03-04 07:59:26,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 07:59:26,750 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 60 [2025-03-04 07:59:26,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:26,750 INFO L225 Difference]: With dead ends: 81 [2025-03-04 07:59:26,750 INFO L226 Difference]: Without dead ends: 81 [2025-03-04 07:59:26,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=162, Invalid=2179, Unknown=11, NotChecked=0, Total=2352 [2025-03-04 07:59:26,751 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:26,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 557 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 07:59:26,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-04 07:59:26,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2025-03-04 07:59:26,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 64 states have (on average 1.1875) internal successors, (76), 70 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2025-03-04 07:59:26,753 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 60 [2025-03-04 07:59:26,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:26,753 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2025-03-04 07:59:26,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.2222222222222223) internal successors, (87), 25 states have internal predecessors, (87), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-04 07:59:26,753 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2025-03-04 07:59:26,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2025-03-04 07:59:26,754 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:26,754 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:26,761 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:59:26,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:26,955 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:26,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:26,955 INFO L85 PathProgramCache]: Analyzing trace with hash -540018551, now seen corresponding path program 1 times [2025-03-04 07:59:26,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:26,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419626459] [2025-03-04 07:59:26,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:26,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:26,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:26,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:26,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:26,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:27,685 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-04 07:59:27,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:27,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419626459] [2025-03-04 07:59:27,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419626459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:27,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881808754] [2025-03-04 07:59:27,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:27,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:27,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:27,688 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:27,689 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:59:27,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-03-04 07:59:27,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-03-04 07:59:27,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:27,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:27,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-03-04 07:59:27,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:27,851 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 07:59:27,854 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 07:59:28,083 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:28,083 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:28,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:59:28,154 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 07:59:28,157 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 07:59:28,252 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:28,253 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:59:28,256 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 24 treesize of output 11 [2025-03-04 07:59:28,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:28,524 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-04 07:59:28,529 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 24 treesize of output 11 [2025-03-04 07:59:28,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:28,603 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 37 treesize of output 17 [2025-03-04 07:59:28,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:28,609 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 27 treesize of output 11 [2025-03-04 07:59:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:28,728 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 07:59:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:59:28,784 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:29,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:29,708 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 73 treesize of output 74 [2025-03-04 07:59:29,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:29,712 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 65 treesize of output 50 [2025-03-04 07:59:29,714 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 632 treesize of output 556 [2025-03-04 07:59:29,722 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 1439 treesize of output 1371 [2025-03-04 07:59:29,734 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 375 treesize of output 359 [2025-03-04 07:59:29,738 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 359 treesize of output 343 [2025-03-04 07:59:29,741 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 343 treesize of output 335 [2025-03-04 07:59:29,746 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 335 treesize of output 303 [2025-03-04 07:59:29,763 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:29,763 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2025-03-04 07:59:29,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:29,768 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2025-03-04 07:59:29,769 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:29,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 20 [2025-03-04 07:59:29,773 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:29,774 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 07:59:29,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 18 treesize of output 10 [2025-03-04 07:59:29,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881808754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:29,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:29,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 22] total 50 [2025-03-04 07:59:29,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269164032] [2025-03-04 07:59:29,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:29,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 07:59:29,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:29,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 07:59:29,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=4202, Unknown=11, NotChecked=0, Total=4422 [2025-03-04 07:59:29,984 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 51 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:30,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:30,864 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-03-04 07:59:30,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:59:30,864 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 60 [2025-03-04 07:59:30,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:30,865 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:59:30,865 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:59:30,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1351 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=357, Invalid=6604, Unknown=11, NotChecked=0, Total=6972 [2025-03-04 07:59:30,867 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 42 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:30,867 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1001 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1401 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:59:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:59:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 07:59:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.1666666666666667) internal successors, (77), 72 states have internal predecessors, (77), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2025-03-04 07:59:30,868 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 60 [2025-03-04 07:59:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:30,869 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2025-03-04 07:59:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.0) internal successors, (100), 45 states have internal predecessors, (100), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:30,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2025-03-04 07:59:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2025-03-04 07:59:30,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:30,869 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:30,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 07:59:31,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:31,070 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:31,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:31,070 INFO L85 PathProgramCache]: Analyzing trace with hash 439294737, now seen corresponding path program 1 times [2025-03-04 07:59:31,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:31,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074393189] [2025-03-04 07:59:31,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:31,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:31,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-03-04 07:59:31,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-03-04 07:59:31,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:31,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-03-04 07:59:31,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:31,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074393189] [2025-03-04 07:59:31,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074393189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:59:31,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:59:31,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:59:31,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601748048] [2025-03-04 07:59:31,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:59:31,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:59:31,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:31,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:59:31,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:31,175 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:31,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:31,267 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-03-04 07:59:31,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:59:31,267 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 61 [2025-03-04 07:59:31,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:31,267 INFO L225 Difference]: With dead ends: 75 [2025-03-04 07:59:31,267 INFO L226 Difference]: Without dead ends: 75 [2025-03-04 07:59:31,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:59:31,268 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 11 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:31,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 268 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:59:31,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-03-04 07:59:31,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-03-04 07:59:31,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 66 states have (on average 1.1363636363636365) internal successors, (75), 71 states have internal predecessors, (75), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:31,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-03-04 07:59:31,274 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 61 [2025-03-04 07:59:31,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:31,275 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-03-04 07:59:31,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.222222222222222) internal successors, (47), 9 states have internal predecessors, (47), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 07:59:31,275 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-03-04 07:59:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-03-04 07:59:31,275 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:31,275 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:31,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 07:59:31,275 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:31,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:31,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1254801167, now seen corresponding path program 1 times [2025-03-04 07:59:31,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:31,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572541698] [2025-03-04 07:59:31,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:31,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:31,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 07:59:31,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 07:59:31,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:31,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:31,908 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:31,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572541698] [2025-03-04 07:59:31,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572541698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:31,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [342279047] [2025-03-04 07:59:31,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:31,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:31,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:31,910 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:31,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:59:32,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 07:59:32,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 07:59:32,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:32,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:32,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-03-04 07:59:32,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:32,080 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 07:59:32,118 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 5 treesize of output 3 [2025-03-04 07:59:32,170 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:32,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:32,231 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 07:59:32,294 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:32,295 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:32,485 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:32,485 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2025-03-04 07:59:32,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:32,536 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 37 treesize of output 17 [2025-03-04 07:59:32,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-04 07:59:32,654 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:59:32,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:33,209 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:33,210 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 36 treesize of output 29 [2025-03-04 07:59:33,212 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 136 treesize of output 112 [2025-03-04 07:59:33,214 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 60 treesize of output 56 [2025-03-04 07:59:33,216 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 30 treesize of output 24 [2025-03-04 07:59:33,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [342279047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:33,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:59:33,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 41 [2025-03-04 07:59:33,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492205966] [2025-03-04 07:59:33,347 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:33,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:59:33,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:33,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:59:33,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2987, Unknown=8, NotChecked=0, Total=3192 [2025-03-04 07:59:33,349 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 38 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:33,989 INFO L93 Difference]: Finished difference Result 76 states and 80 transitions. [2025-03-04 07:59:33,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:59:33,990 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 38 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 63 [2025-03-04 07:59:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:33,990 INFO L225 Difference]: With dead ends: 76 [2025-03-04 07:59:33,990 INFO L226 Difference]: Without dead ends: 76 [2025-03-04 07:59:33,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 824 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=290, Invalid=4394, Unknown=8, NotChecked=0, Total=4692 [2025-03-04 07:59:33,992 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 50 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:33,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 720 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:59:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-03-04 07:59:33,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-03-04 07:59:33,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 67 states have (on average 1.1343283582089552) internal successors, (76), 72 states have internal predecessors, (76), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-03-04 07:59:33,994 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 63 [2025-03-04 07:59:33,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:33,994 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-03-04 07:59:33,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.3658536585365852) internal successors, (97), 38 states have internal predecessors, (97), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 07:59:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-03-04 07:59:33,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 07:59:33,995 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:33,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:34,002 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:59:34,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:34,195 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:34,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:34,196 INFO L85 PathProgramCache]: Analyzing trace with hash 264140146, now seen corresponding path program 1 times [2025-03-04 07:59:34,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:34,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345270212] [2025-03-04 07:59:34,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:34,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:34,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 07:59:34,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:59:34,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:34,214 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:34,660 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:34,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345270212] [2025-03-04 07:59:34,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345270212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:34,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558487899] [2025-03-04 07:59:34,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:34,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:34,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:34,662 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:34,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:59:34,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 07:59:34,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:59:34,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:34,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:34,831 INFO L256 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-03-04 07:59:34,833 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:34,835 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 07:59:34,863 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:34,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:34,870 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 07:59:34,899 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:34,900 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 07:59:34,982 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-04 07:59:34,982 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-03-04 07:59:35,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:35,019 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 07:59:35,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,070 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 16 treesize of output 16 [2025-03-04 07:59:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-04 07:59:35,130 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:35,208 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2414 (Array Int Int))) (or (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2414) |c_ULTIMATE.start_main_~s~0#1.base|) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (not (= v_ArrVal_2414 (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_update_at_~head#1.offset| 4))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base|) .cse0 (select v_ArrVal_2414 .cse0))))))) is different from false [2025-03-04 07:59:35,269 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_2413 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int)) (or (not (= |c_ULTIMATE.start_main_~s~0#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_update_at_~head#1.base| v_ArrVal_2413) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_14) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-04 07:59:35,388 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_2413 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int)) (or (not (= (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~s~0#1.base|) |c_ULTIMATE.start_main_~s~0#1.offset|) v_ArrVal_2413) |c_ULTIMATE.start_main_~s~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_14) 0) |c_ULTIMATE.start_main_~s~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_main_~s~0#1.offset|))) is different from false [2025-03-04 07:59:35,394 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_2413 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int)) (or (not (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (store (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|) v_ArrVal_2413) |c_ULTIMATE.start_sll_circular_create_#res#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_14) 0))) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) is different from false [2025-03-04 07:59:35,455 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2412 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int)) (or (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2412))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) v_ArrVal_2413)) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_14) 0))))) is different from false [2025-03-04 07:59:35,464 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_DerPreprocessor_14 Int) (v_ArrVal_2413 (Array Int Int)) (v_ArrVal_2412 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| Int)) (or (not (= (select (store (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_2412))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) v_ArrVal_2413)) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| 4) v_DerPreprocessor_14) 0) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_sll_circular_update_at_~head#1.offset_81| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) is different from false [2025-03-04 07:59:35,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,469 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 42 treesize of output 35 [2025-03-04 07:59:35,471 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 285 treesize of output 267 [2025-03-04 07:59:35,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,481 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 204 treesize of output 200 [2025-03-04 07:59:35,488 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 226 treesize of output 220 [2025-03-04 07:59:35,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:35,497 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 246 treesize of output 243 [2025-03-04 07:59:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 7 not checked. [2025-03-04 07:59:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558487899] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:59:35,875 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:59:35,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 26] total 55 [2025-03-04 07:59:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916685375] [2025-03-04 07:59:35,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:59:35,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-04 07:59:35,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:59:35,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-04 07:59:35,878 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=2175, Unknown=32, NotChecked=594, Total=2970 [2025-03-04 07:59:35,878 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 49 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:59:36,520 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2025-03-04 07:59:36,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 07:59:36,520 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 49 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 64 [2025-03-04 07:59:36,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:59:36,521 INFO L225 Difference]: With dead ends: 74 [2025-03-04 07:59:36,521 INFO L226 Difference]: Without dead ends: 74 [2025-03-04 07:59:36,521 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 97 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=213, Invalid=2859, Unknown=32, NotChecked=678, Total=3782 [2025-03-04 07:59:36,522 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 77 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:59:36,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 774 Invalid, 1426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1063 Invalid, 0 Unknown, 357 Unchecked, 0.4s Time] [2025-03-04 07:59:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-04 07:59:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2025-03-04 07:59:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 64 states have (on average 1.125) internal successors, (72), 69 states have internal predecessors, (72), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:59:36,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2025-03-04 07:59:36,523 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 64 [2025-03-04 07:59:36,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:59:36,523 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2025-03-04 07:59:36,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 49 states have internal predecessors, (120), 3 states have call successors, (3), 3 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-04 07:59:36,524 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2025-03-04 07:59:36,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-03-04 07:59:36,524 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:59:36,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:59:36,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:59:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:36,725 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-03-04 07:59:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:59:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1613790879, now seen corresponding path program 1 times [2025-03-04 07:59:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:59:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555230060] [2025-03-04 07:59:36,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:59:36,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:59:36,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:59:36,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:36,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:37,678 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-04 07:59:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:59:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555230060] [2025-03-04 07:59:37,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555230060] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:59:37,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833566077] [2025-03-04 07:59:37,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:59:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:59:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:59:37,681 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:59:37,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:59:37,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-04 07:59:37,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-04 07:59:37,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:59:37,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:59:37,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-04 07:59:37,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:59:37,870 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 07:59:37,968 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:59:37,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:59:38,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-04 07:59:38,033 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 07:59:38,115 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-04 07:59:38,115 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2025-03-04 07:59:38,119 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 24 treesize of output 11 [2025-03-04 07:59:38,271 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 15 treesize of output 7 [2025-03-04 07:59:38,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:38,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:38,351 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-04 07:59:38,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 40 [2025-03-04 07:59:38,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:59:38,453 INFO L349 Elim1Store]: treesize reduction 47, result has 13.0 percent of original size [2025-03-04 07:59:38,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 25 [2025-03-04 07:59:38,830 INFO L349 Elim1Store]: treesize reduction 40, result has 58.8 percent of original size [2025-03-04 07:59:38,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 103 [2025-03-04 07:59:39,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:59:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 07:59:39,239 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:59:39,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:39,738 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 37 treesize of output 41 [2025-03-04 07:59:58,110 INFO L349 Elim1Store]: treesize reduction 299, result has 51.3 percent of original size [2025-03-04 07:59:58,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 17 case distinctions, treesize of input 3484 treesize of output 3287 [2025-03-04 07:59:58,829 INFO L349 Elim1Store]: treesize reduction 304, result has 40.2 percent of original size [2025-03-04 07:59:58,830 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 1622 treesize of output 1767 [2025-03-04 07:59:58,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:59:58,886 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 1425 treesize of output 1402 [2025-03-04 07:59:58,985 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 1445 treesize of output 1425 [2025-03-04 07:59:59,136 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 1437 treesize of output 1435 [2025-03-04 07:59:59,666 INFO L349 Elim1Store]: treesize reduction 8, result has 96.3 percent of original size [2025-03-04 07:59:59,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 1631 treesize of output 1787 [2025-03-04 07:59:59,740 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 1419 treesize of output 1417 [2025-03-04 07:59:59,813 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 1417 treesize of output 1415 [2025-03-04 07:59:59,881 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 1415 treesize of output 1413