./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-2.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 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:58:39,415 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:58:39,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 11:58:39,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:58:39,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:58:39,505 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:58:39,506 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:58:39,506 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:58:39,507 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 11:58:39,507 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 11:58:39,507 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:58:39,507 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:58:39,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:58:39,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:58:39,508 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:58:39,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:58:39,509 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:58:39,510 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 11:58:39,510 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:39,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:58:39,511 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:58:39,511 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 -> 8d477dcc38abb71f88978d460e8393ef9ba09f24c134f3de362c4df2a3599c9a [2025-03-17 11:58:39,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:58:39,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:58:39,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:58:39,740 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:58:39,740 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:58:39,742 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2025-03-17 11:58:40,880 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7c21229/fbe76cd7b9cb4634ad1a667d2640a9d2/FLAGebbceceef [2025-03-17 11:58:41,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:58:41,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2025-03-17 11:58:41,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7c21229/fbe76cd7b9cb4634ad1a667d2640a9d2/FLAGebbceceef [2025-03-17 11:58:41,446 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9b7c21229/fbe76cd7b9cb4634ad1a667d2640a9d2 [2025-03-17 11:58:41,448 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:58:41,449 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:58:41,449 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:41,449 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:58:41,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:58:41,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5788b833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41, skipping insertion in model container [2025-03-17 11:58:41,454 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:58:41,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:41,703 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:58:41,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:58:41,761 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:58:41,762 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41 WrapperNode [2025-03-17 11:58:41,762 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:58:41,763 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:41,763 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:58:41,763 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:58:41,767 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,775 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,790 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2025-03-17 11:58:41,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:58:41,791 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:58:41,791 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:58:41,791 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:58:41,797 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,797 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,809 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 13, 10]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 13 writes are split as follows [0, 7, 6]. [2025-03-17 11:58:41,809 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,815 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,817 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:58:41,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:58:41,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:58:41,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:58:41,820 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (1/1) ... [2025-03-17 11:58:41,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:58:41,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:41,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 11:58:41,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 11:58:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 11:58:41,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:58:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:58:41,862 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-03-17 11:58:41,862 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-03-17 11:58:41,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:58:41,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:58:42,222 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-03-17 11:58:42,222 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:58:42,236 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:58:42,236 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:58:42,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:42 BoogieIcfgContainer [2025-03-17 11:58:42,237 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:58:42,239 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:58:42,239 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:58:42,243 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:58:42,243 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:58:41" (1/3) ... [2025-03-17 11:58:42,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc09266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:42, skipping insertion in model container [2025-03-17 11:58:42,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:58:41" (2/3) ... [2025-03-17 11:58:42,244 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc09266 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:58:42, skipping insertion in model container [2025-03-17 11:58:42,244 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:58:42" (3/3) ... [2025-03-17 11:58:42,245 INFO L128 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2025-03-17 11:58:42,257 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:58:42,258 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG length_test03-2.i that has 2 procedures, 125 locations, 1 initial locations, 4 loop locations, and 59 error locations. [2025-03-17 11:58:42,294 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:58:42,305 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;@5f7fc4f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:58:42,306 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-17 11:58:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 62 states have (on average 2.064516129032258) internal successors, (128), 121 states have internal predecessors, (128), 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-17 11:58:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:58:42,312 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:42,313 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:58:42,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:42,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:42,317 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 1 times [2025-03-17 11:58:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151684023] [2025-03-17 11:58:42,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:42,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:42,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:58:42,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:58:42,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:42,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:42,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:42,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151684023] [2025-03-17 11:58:42,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151684023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:42,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:42,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:58:42,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313904355] [2025-03-17 11:58:42,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:42,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:42,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:42,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:42,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:42,485 INFO L87 Difference]: Start difference. First operand has 125 states, 62 states have (on average 2.064516129032258) internal successors, (128), 121 states have internal predecessors, (128), 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 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:42,625 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2025-03-17 11:58:42,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:42,628 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:58:42,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:42,634 INFO L225 Difference]: With dead ends: 161 [2025-03-17 11:58:42,634 INFO L226 Difference]: Without dead ends: 159 [2025-03-17 11:58:42,636 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:42,638 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:42,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:42,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-17 11:58:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2025-03-17 11:58:42,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 117 states have internal predecessors, (123), 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-17 11:58:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2025-03-17 11:58:42,695 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 2 [2025-03-17 11:58:42,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:42,695 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2025-03-17 11:58:42,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,695 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2025-03-17 11:58:42,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-03-17 11:58:42,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:42,695 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-03-17 11:58:42,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:58:42,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:42,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:42,697 INFO L85 PathProgramCache]: Analyzing trace with hash 3488, now seen corresponding path program 1 times [2025-03-17 11:58:42,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:42,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952026005] [2025-03-17 11:58:42,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:42,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:42,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-17 11:58:42,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-17 11:58:42,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:42,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952026005] [2025-03-17 11:58:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952026005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:42,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:42,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 11:58:42,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66587067] [2025-03-17 11:58:42,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:42,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:42,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:42,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:42,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:42,789 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:42,879 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2025-03-17 11:58:42,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:42,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-03-17 11:58:42,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:42,882 INFO L225 Difference]: With dead ends: 121 [2025-03-17 11:58:42,882 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 11:58:42,882 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:42,882 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:42,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:42,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 11:58:42,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-17 11:58:42,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 115 states have internal predecessors, (121), 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-17 11:58:42,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2025-03-17 11:58:42,892 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 2 [2025-03-17 11:58:42,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:42,893 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2025-03-17 11:58:42,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:42,893 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2025-03-17 11:58:42,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:58:42,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:42,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:58:42,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:58:42,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:42,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:42,895 INFO L85 PathProgramCache]: Analyzing trace with hash 103923881, now seen corresponding path program 1 times [2025-03-17 11:58:42,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:42,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517213746] [2025-03-17 11:58:42,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:42,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:42,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:58:42,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:58:42,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:42,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:42,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517213746] [2025-03-17 11:58:42,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517213746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:42,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:42,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:42,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467746677] [2025-03-17 11:58:42,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:42,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:42,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:42,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:42,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:42,969 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,065 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-03-17 11:58:43,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:43,069 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:58:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,069 INFO L225 Difference]: With dead ends: 134 [2025-03-17 11:58:43,070 INFO L226 Difference]: Without dead ends: 134 [2025-03-17 11:58:43,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,070 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-03-17 11:58:43,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2025-03-17 11:58:43,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9384615384615385) internal successors, (126), 117 states have internal predecessors, (126), 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-17 11:58:43,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2025-03-17 11:58:43,078 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2025-03-17 11:58:43,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,078 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2025-03-17 11:58:43,078 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,078 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2025-03-17 11:58:43,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-17 11:58:43,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,078 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-17 11:58:43,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:58:43,079 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:43,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:43,079 INFO L85 PathProgramCache]: Analyzing trace with hash 103923882, now seen corresponding path program 1 times [2025-03-17 11:58:43,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:43,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601905957] [2025-03-17 11:58:43,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:43,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:43,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-17 11:58:43,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-17 11:58:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:43,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:43,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601905957] [2025-03-17 11:58:43,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601905957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:43,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:43,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:43,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841087784] [2025-03-17 11:58:43,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:43,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,156 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,222 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-03-17 11:58:43,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:43,222 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-17 11:58:43,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,223 INFO L225 Difference]: With dead ends: 121 [2025-03-17 11:58:43,223 INFO L226 Difference]: Without dead ends: 121 [2025-03-17 11:58:43,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,224 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-03-17 11:58:43,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-03-17 11:58:43,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 115 states have internal predecessors, (124), 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-17 11:58:43,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2025-03-17 11:58:43,229 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 5 [2025-03-17 11:58:43,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,229 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2025-03-17 11:58:43,229 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 11:58:43,230 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2025-03-17 11:58:43,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:58:43,230 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,230 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:43,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:58:43,231 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting appendErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:43,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:43,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1253370294, now seen corresponding path program 1 times [2025-03-17 11:58:43,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:43,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834673348] [2025-03-17 11:58:43,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:43,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:43,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:58:43,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:58:43,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:43,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:43,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:43,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:43,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834673348] [2025-03-17 11:58:43,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834673348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:43,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:43,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:43,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303498358] [2025-03-17 11:58:43,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:43,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:43,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,284 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 11:58:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,348 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-03-17 11:58:43,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:43,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-17 11:58:43,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,349 INFO L225 Difference]: With dead ends: 114 [2025-03-17 11:58:43,349 INFO L226 Difference]: Without dead ends: 114 [2025-03-17 11:58:43,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,350 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-17 11:58:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-03-17 11:58:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 110 states have internal predecessors, (119), 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-17 11:58:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-03-17 11:58:43,354 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 11 [2025-03-17 11:58:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,355 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-03-17 11:58:43,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 11:58:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-03-17 11:58:43,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 11:58:43,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,355 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:43,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:58:43,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting appendErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:43,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1253370293, now seen corresponding path program 1 times [2025-03-17 11:58:43,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976450836] [2025-03-17 11:58:43,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:43,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:43,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 11:58:43,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 11:58:43,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:43,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:43,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:43,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976450836] [2025-03-17 11:58:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976450836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:43,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:43,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:58:43,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953738384] [2025-03-17 11:58:43,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:43,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:43,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,486 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 11:58:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,530 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-03-17 11:58:43,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:43,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 11 [2025-03-17 11:58:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,531 INFO L225 Difference]: With dead ends: 109 [2025-03-17 11:58:43,531 INFO L226 Difference]: Without dead ends: 109 [2025-03-17 11:58:43,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:43,532 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:43,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-17 11:58:43,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-03-17 11:58:43,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.7538461538461538) internal successors, (114), 105 states have internal predecessors, (114), 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-17 11:58:43,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-03-17 11:58:43,536 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 11 [2025-03-17 11:58:43,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,536 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-03-17 11:58:43,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-17 11:58:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-03-17 11:58:43,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:58:43,536 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,536 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:43,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:58:43,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:43,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:43,537 INFO L85 PathProgramCache]: Analyzing trace with hash -199773358, now seen corresponding path program 1 times [2025-03-17 11:58:43,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:43,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360812647] [2025-03-17 11:58:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:43,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:43,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:58:43,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:58:43,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:43,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360812647] [2025-03-17 11:58:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360812647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 11:58:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815709746] [2025-03-17 11:58:43,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:43,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:43,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:43,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:43,704 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-17 11:58:43,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:43,900 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2025-03-17 11:58:43,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 11:58:43,900 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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 12 [2025-03-17 11:58:43,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:43,901 INFO L225 Difference]: With dead ends: 213 [2025-03-17 11:58:43,901 INFO L226 Difference]: Without dead ends: 213 [2025-03-17 11:58:43,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:58:43,902 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 235 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:43,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 203 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:43,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-03-17 11:58:43,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 142. [2025-03-17 11:58:43,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.6601941747572815) internal successors, (171), 137 states have internal predecessors, (171), 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-17 11:58:43,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2025-03-17 11:58:43,912 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 12 [2025-03-17 11:58:43,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:43,912 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2025-03-17 11:58:43,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 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-17 11:58:43,912 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2025-03-17 11:58:43,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-17 11:58:43,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:43,913 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:43,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:58:43,913 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:43,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:43,914 INFO L85 PathProgramCache]: Analyzing trace with hash -199773357, now seen corresponding path program 1 times [2025-03-17 11:58:43,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:43,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658548515] [2025-03-17 11:58:43,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:43,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:43,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-17 11:58:43,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-17 11:58:43,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:43,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:44,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658548515] [2025-03-17 11:58:44,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658548515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:44,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053537230] [2025-03-17 11:58:44,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:44,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:44,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:44,156 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-17 11:58:44,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,399 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2025-03-17 11:58:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 12 [2025-03-17 11:58:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,400 INFO L225 Difference]: With dead ends: 221 [2025-03-17 11:58:44,400 INFO L226 Difference]: Without dead ends: 221 [2025-03-17 11:58:44,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:58:44,401 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 218 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,405 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 234 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:44,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-17 11:58:44,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 166. [2025-03-17 11:58:44,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.6771653543307086) internal successors, (213), 161 states have internal predecessors, (213), 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-17 11:58:44,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2025-03-17 11:58:44,409 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 12 [2025-03-17 11:58:44,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,409 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2025-03-17 11:58:44,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-17 11:58:44,410 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2025-03-17 11:58:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 11:58:44,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,410 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:58:44,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:44,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1376654375, now seen corresponding path program 1 times [2025-03-17 11:58:44,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650251873] [2025-03-17 11:58:44,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 11:58:44,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 11:58:44,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:44,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:44,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650251873] [2025-03-17 11:58:44,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650251873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:44,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:44,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:58:44,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801911103] [2025-03-17 11:58:44,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:44,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:58:44,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:44,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:58:44,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:58:44,624 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:58:44,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:44,743 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2025-03-17 11:58:44,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:58:44,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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 15 [2025-03-17 11:58:44,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:44,745 INFO L225 Difference]: With dead ends: 188 [2025-03-17 11:58:44,745 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 11:58:44,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-17 11:58:44,746 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:44,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:44,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 11:58:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-17 11:58:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 146 states have (on average 1.6164383561643836) internal successors, (236), 180 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:58:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2025-03-17 11:58:44,755 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 15 [2025-03-17 11:58:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:44,755 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2025-03-17 11:58:44,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 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-17 11:58:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2025-03-17 11:58:44,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-17 11:58:44,756 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:44,756 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:44,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:58:44,756 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:44,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394618, now seen corresponding path program 1 times [2025-03-17 11:58:44,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:44,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499563501] [2025-03-17 11:58:44,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:44,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:44,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 11:58:44,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 11:58:44,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:44,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:45,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:45,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499563501] [2025-03-17 11:58:45,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499563501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:45,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:45,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-17 11:58:45,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92920144] [2025-03-17 11:58:45,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:45,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:58:45,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:45,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:58:45,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:58:45,145 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-17 11:58:45,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:45,309 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2025-03-17 11:58:45,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:58:45,310 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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 21 [2025-03-17 11:58:45,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:45,311 INFO L225 Difference]: With dead ends: 188 [2025-03-17 11:58:45,311 INFO L226 Difference]: Without dead ends: 188 [2025-03-17 11:58:45,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:58:45,312 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:45,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 567 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 11:58:45,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-03-17 11:58:45,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-03-17 11:58:45,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 180 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:58:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2025-03-17 11:58:45,317 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 21 [2025-03-17 11:58:45,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:45,317 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2025-03-17 11:58:45,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 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-17 11:58:45,317 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2025-03-17 11:58:45,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-17 11:58:45,317 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:45,317 INFO L218 NwaCegarLoop]: trace histogram [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-17 11:58:45,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:58:45,318 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:45,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:45,318 INFO L85 PathProgramCache]: Analyzing trace with hash 267217788, now seen corresponding path program 1 times [2025-03-17 11:58:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537676135] [2025-03-17 11:58:45,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:45,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:45,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-17 11:58:45,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-17 11:58:45,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:45,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:45,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:45,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537676135] [2025-03-17 11:58:45,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537676135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:45,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:45,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-17 11:58:45,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447378938] [2025-03-17 11:58:45,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:45,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-17 11:58:45,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:45,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-17 11:58:45,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-17 11:58:45,667 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 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-17 11:58:45,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:45,901 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2025-03-17 11:58:45,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-17 11:58:45,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 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 23 [2025-03-17 11:58:45,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:45,902 INFO L225 Difference]: With dead ends: 222 [2025-03-17 11:58:45,902 INFO L226 Difference]: Without dead ends: 222 [2025-03-17 11:58:45,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-03-17 11:58:45,903 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 144 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:45,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 500 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 11:58:45,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-03-17 11:58:45,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 153. [2025-03-17 11:58:45,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.5526315789473684) internal successors, (177), 147 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:58:45,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2025-03-17 11:58:45,907 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 23 [2025-03-17 11:58:45,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:45,907 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2025-03-17 11:58:45,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 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-17 11:58:45,907 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2025-03-17 11:58:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:58:45,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:45,908 INFO L218 NwaCegarLoop]: trace histogram [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-17 11:58:45,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:58:45,908 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:45,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:45,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1404941286, now seen corresponding path program 1 times [2025-03-17 11:58:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331440412] [2025-03-17 11:58:45,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:45,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:58:45,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:58:45,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:45,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:46,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331440412] [2025-03-17 11:58:46,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331440412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:46,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989716152] [2025-03-17 11:58:46,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:46,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:46,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:46,141 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:46,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 11:58:46,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:58:46,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:58:46,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:46,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:46,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 11:58:46,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:46,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:46,319 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2025-03-17 11:58:46,416 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 11:58:46,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 11:58:46,437 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:58:46,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 11:58:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 11:58:46,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:46,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989716152] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:46,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:58:46,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2025-03-17 11:58:46,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359067024] [2025-03-17 11:58:46,510 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:46,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-17 11:58:46,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:46,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-17 11:58:46,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-03-17 11:58:46,511 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:58:46,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:46,881 INFO L93 Difference]: Finished difference Result 192 states and 220 transitions. [2025-03-17 11:58:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:58:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-17 11:58:46,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:46,882 INFO L225 Difference]: With dead ends: 192 [2025-03-17 11:58:46,882 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 11:58:46,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2025-03-17 11:58:46,883 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:46,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 330 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 406 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2025-03-17 11:58:46,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 11:58:46,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2025-03-17 11:58:46,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 150 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:58:46,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2025-03-17 11:58:46,890 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 31 [2025-03-17 11:58:46,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:46,891 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2025-03-17 11:58:46,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:58:46,891 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2025-03-17 11:58:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-17 11:58:46,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:46,894 INFO L218 NwaCegarLoop]: trace histogram [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-17 11:58:46,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 11:58:47,094 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,SelfDestructingSolverStorable11 [2025-03-17 11:58:47,096 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:47,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:47,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1404941285, now seen corresponding path program 1 times [2025-03-17 11:58:47,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:47,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12504185] [2025-03-17 11:58:47,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:47,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:58:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:58:47,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:47,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12504185] [2025-03-17 11:58:47,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12504185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:47,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514712613] [2025-03-17 11:58:47,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:47,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:47,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:47,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:47,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 11:58:47,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-17 11:58:47,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-17 11:58:47,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:47,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:47,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-17 11:58:47,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:47,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:47,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:58:47,559 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2025-03-17 11:58:47,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:47,633 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-17 11:58:47,638 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:47,639 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-17 11:58:47,678 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:58:47,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:58:47,719 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-03-17 11:58:47,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:47,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514712613] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:47,955 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:58:47,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2025-03-17 11:58:47,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251833813] [2025-03-17 11:58:47,955 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:47,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:58:47,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:47,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:58:47,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-03-17 11:58:47,956 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:58:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:48,353 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2025-03-17 11:58:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 11:58:48,354 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-03-17 11:58:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:48,355 INFO L225 Difference]: With dead ends: 230 [2025-03-17 11:58:48,355 INFO L226 Difference]: Without dead ends: 230 [2025-03-17 11:58:48,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2025-03-17 11:58:48,355 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 235 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 424 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 411 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2025-03-17 11:58:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-03-17 11:58:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2025-03-17 11:58:48,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 194 states have internal predecessors, (245), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 11:58:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2025-03-17 11:58:48,362 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 31 [2025-03-17 11:58:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:48,363 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2025-03-17 11:58:48,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-17 11:58:48,363 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2025-03-17 11:58:48,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-17 11:58:48,363 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:48,364 INFO L218 NwaCegarLoop]: trace histogram [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-17 11:58:48,371 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-17 11:58:48,564 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,SelfDestructingSolverStorable12 [2025-03-17 11:58:48,564 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:48,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:48,565 INFO L85 PathProgramCache]: Analyzing trace with hash -461011310, now seen corresponding path program 1 times [2025-03-17 11:58:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23111850] [2025-03-17 11:58:48,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:48,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-17 11:58:48,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-17 11:58:48,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:48,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:48,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23111850] [2025-03-17 11:58:48,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23111850] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:58:48,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:58:48,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 11:58:48,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996805770] [2025-03-17 11:58:48,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:58:48,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:58:48,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:48,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:58:48,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:58:48,610 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-17 11:58:48,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:48,622 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2025-03-17 11:58:48,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:58:48,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 30 [2025-03-17 11:58:48,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:48,623 INFO L225 Difference]: With dead ends: 192 [2025-03-17 11:58:48,623 INFO L226 Difference]: Without dead ends: 192 [2025-03-17 11:58:48,624 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-17 11:58:48,624 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:48,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 191 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:58:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-03-17 11:58:48,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2025-03-17 11:58:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 169 states have internal predecessors, (204), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-17 11:58:48,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2025-03-17 11:58:48,631 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 30 [2025-03-17 11:58:48,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:48,631 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2025-03-17 11:58:48,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-17 11:58:48,631 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2025-03-17 11:58:48,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-17 11:58:48,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:48,632 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-17 11:58:48,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:58:48,632 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:48,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:48,633 INFO L85 PathProgramCache]: Analyzing trace with hash -926586689, now seen corresponding path program 1 times [2025-03-17 11:58:48,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:48,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525313958] [2025-03-17 11:58:48,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:48,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:58:48,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:58:48,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,856 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525313958] [2025-03-17 11:58:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525313958] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:48,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803219970] [2025-03-17 11:58:48,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:48,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:48,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:48,859 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:48,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 11:58:48,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-17 11:58:48,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-17 11:58:48,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:48,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:48,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-17 11:58:48,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:49,072 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:58:49,073 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 16 treesize of output 15 [2025-03-17 11:58:49,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:49,152 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:49,337 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 25 [2025-03-17 11:58:49,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:49,611 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 32 treesize of output 34 [2025-03-17 11:58:49,686 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:49,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803219970] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:49,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:49,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-03-17 11:58:49,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787159427] [2025-03-17 11:58:49,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:49,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:58:49,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:49,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:58:49,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-03-17 11:58:49,688 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:58:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:50,410 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2025-03-17 11:58:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:58:50,412 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-03-17 11:58:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:50,413 INFO L225 Difference]: With dead ends: 183 [2025-03-17 11:58:50,413 INFO L226 Difference]: Without dead ends: 183 [2025-03-17 11:58:50,414 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=1270, Unknown=0, NotChecked=0, Total=1560 [2025-03-17 11:58:50,414 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 251 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:50,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 900 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:50,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-03-17 11:58:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2025-03-17 11:58:50,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.4087591240875912) internal successors, (193), 165 states have internal predecessors, (193), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:58:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2025-03-17 11:58:50,421 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 33 [2025-03-17 11:58:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:50,421 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2025-03-17 11:58:50,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-17 11:58:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2025-03-17 11:58:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:58:50,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:50,422 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, 1] [2025-03-17 11:58:50,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 11:58:50,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:50,623 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:50,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:50,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1580753262, now seen corresponding path program 1 times [2025-03-17 11:58:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:50,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140113840] [2025-03-17 11:58:50,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:50,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:58:50,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:58:50,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:50,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:51,027 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140113840] [2025-03-17 11:58:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140113840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75098798] [2025-03-17 11:58:51,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:51,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:51,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:51,030 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:51,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:58:51,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:58:51,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:58:51,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:51,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:51,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:58:51,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:51,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:51,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:51,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2025-03-17 11:58:51,300 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-17 11:58:51,301 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 16 treesize of output 18 [2025-03-17 11:58:51,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:58:51,382 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 32 treesize of output 12 [2025-03-17 11:58:51,392 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:51,392 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:51,559 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 96 treesize of output 90 [2025-03-17 11:58:52,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:52,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75098798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:52,299 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:52,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2025-03-17 11:58:52,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73336078] [2025-03-17 11:58:52,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:52,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 11:58:52,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:52,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 11:58:52,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-03-17 11:58:52,301 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:58:52,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:52,876 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2025-03-17 11:58:52,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:58:52,877 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-17 11:58:52,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:52,878 INFO L225 Difference]: With dead ends: 198 [2025-03-17 11:58:52,878 INFO L226 Difference]: Without dead ends: 198 [2025-03-17 11:58:52,878 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:58:52,879 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 230 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:52,879 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 654 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:52,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-17 11:58:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2025-03-17 11:58:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 165 states have internal predecessors, (192), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:58:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2025-03-17 11:58:52,883 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 39 [2025-03-17 11:58:52,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:52,883 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2025-03-17 11:58:52,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:58:52,883 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2025-03-17 11:58:52,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 11:58:52,883 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:52,884 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, 1] [2025-03-17 11:58:52,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:53,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-17 11:58:53,084 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:53,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1580753261, now seen corresponding path program 1 times [2025-03-17 11:58:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:53,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609906988] [2025-03-17 11:58:53,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:53,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:58:53,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:58:53,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:53,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:53,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:53,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609906988] [2025-03-17 11:58:53,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609906988] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:53,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158030649] [2025-03-17 11:58:53,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:53,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:53,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:53,588 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:53,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:58:53,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 11:58:53,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 11:58:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:53,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:58:53,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:53,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:58:53,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:53,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:53,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:58:53,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-17 11:58:53,963 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:58:53,963 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 18 treesize of output 13 [2025-03-17 11:58:53,970 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:58:53,971 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 15 treesize of output 15 [2025-03-17 11:58:54,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-03-17 11:58:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:54,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:54,324 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 76 treesize of output 70 [2025-03-17 11:58:54,345 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 34 treesize of output 28 [2025-03-17 11:58:54,405 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 104 treesize of output 98 [2025-03-17 11:58:54,573 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 44 treesize of output 38 [2025-03-17 11:58:54,674 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 44 treesize of output 38 [2025-03-17 11:58:54,787 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 44 treesize of output 38 [2025-03-17 11:58:54,888 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 44 treesize of output 38 [2025-03-17 11:58:54,986 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 44 treesize of output 38 [2025-03-17 11:58:55,084 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 44 treesize of output 38 [2025-03-17 11:58:55,179 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 44 treesize of output 38 [2025-03-17 11:58:55,271 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:55,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158030649] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:58:55,271 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:58:55,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 20 [2025-03-17 11:58:55,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708736142] [2025-03-17 11:58:55,271 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:55,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:58:55,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:55,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:58:55,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-03-17 11:58:55,272 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:58:55,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:55,850 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2025-03-17 11:58:55,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:58:55,851 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-03-17 11:58:55,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:55,854 INFO L225 Difference]: With dead ends: 196 [2025-03-17 11:58:55,854 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 11:58:55,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-03-17 11:58:55,854 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 158 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:55,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 548 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-17 11:58:55,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 11:58:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2025-03-17 11:58:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3941605839416058) internal successors, (191), 165 states have internal predecessors, (191), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:58:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2025-03-17 11:58:55,860 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 39 [2025-03-17 11:58:55,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:55,860 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2025-03-17 11:58:55,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-17 11:58:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2025-03-17 11:58:55,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-17 11:58:55,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:55,861 INFO L218 NwaCegarLoop]: trace histogram [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-17 11:58:55,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:56,061 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,SelfDestructingSolverStorable16 [2025-03-17 11:58:56,062 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:56,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:56,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1479744462, now seen corresponding path program 1 times [2025-03-17 11:58:56,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:56,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255529863] [2025-03-17 11:58:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:56,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:56,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:58:56,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:58:56,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:56,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:56,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:56,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:56,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255529863] [2025-03-17 11:58:56,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255529863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:56,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85063009] [2025-03-17 11:58:56,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:56,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:56,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:56,507 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:56,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 11:58:56,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-17 11:58:56,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-17 11:58:56,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:56,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:56,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-17 11:58:56,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:56,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:56,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:56,656 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-17 11:58:56,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:56,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:58:56,675 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 21 treesize of output 20 [2025-03-17 11:58:56,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-17 11:58:56,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:56,916 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:56,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85063009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:56,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:58:56,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-03-17 11:58:56,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300743353] [2025-03-17 11:58:56,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:56,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:58:56,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:56,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:58:56,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=281, Unknown=9, NotChecked=0, Total=342 [2025-03-17 11:58:56,997 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:57,456 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2025-03-17 11:58:57,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:58:57,457 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-03-17 11:58:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:57,458 INFO L225 Difference]: With dead ends: 247 [2025-03-17 11:58:57,458 INFO L226 Difference]: Without dead ends: 247 [2025-03-17 11:58:57,458 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=523, Unknown=9, NotChecked=0, Total=650 [2025-03-17 11:58:57,458 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:57,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 738 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:58:57,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-17 11:58:57,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 186. [2025-03-17 11:58:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 175 states have internal predecessors, (202), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:58:57,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 214 transitions. [2025-03-17 11:58:57,463 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 214 transitions. Word has length 40 [2025-03-17 11:58:57,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:57,463 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 214 transitions. [2025-03-17 11:58:57,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:57,463 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 214 transitions. [2025-03-17 11:58:57,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-17 11:58:57,466 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:57,466 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:58:57,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:57,670 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,SelfDestructingSolverStorable17 [2025-03-17 11:58:57,670 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:57,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:57,670 INFO L85 PathProgramCache]: Analyzing trace with hash -159578700, now seen corresponding path program 1 times [2025-03-17 11:58:57,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:57,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241750406] [2025-03-17 11:58:57,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:57,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:58:57,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:58:57,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:58:57,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:57,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:58,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:58:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241750406] [2025-03-17 11:58:58,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241750406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:58,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463776717] [2025-03-17 11:58:58,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:58,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:58,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:58:58,527 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:58:58,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-17 11:58:58,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:58:58,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:58:58,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:58:58,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:58:58,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-17 11:58:58,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:58:58,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:58:58,672 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:58:58,673 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-17 11:58:58,689 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 13 treesize of output 9 [2025-03-17 11:58:58,692 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 13 treesize of output 9 [2025-03-17 11:58:58,809 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 18 treesize of output 13 [2025-03-17 11:58:58,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 18 treesize of output 13 [2025-03-17 11:58:58,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 11:58:58,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:58:58,992 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1484 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1485 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2025-03-17 11:58:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463776717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:58:58,993 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:58:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2025-03-17 11:58:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567374248] [2025-03-17 11:58:58,993 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:58:58,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-17 11:58:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:58:58,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-17 11:58:58,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=860, Unknown=1, NotChecked=60, Total=1056 [2025-03-17 11:58:58,994 INFO L87 Difference]: Start difference. First operand 186 states and 214 transitions. Second operand has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:59,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:58:59,783 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2025-03-17 11:58:59,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-03-17 11:58:59,784 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-03-17 11:58:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:58:59,785 INFO L225 Difference]: With dead ends: 252 [2025-03-17 11:58:59,785 INFO L226 Difference]: Without dead ends: 252 [2025-03-17 11:58:59,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1654, Unknown=1, NotChecked=86, Total=2070 [2025-03-17 11:58:59,786 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 248 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:58:59,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 751 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:58:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-03-17 11:58:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 196. [2025-03-17 11:58:59,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.3612903225806452) internal successors, (211), 185 states have internal predecessors, (211), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-17 11:58:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2025-03-17 11:58:59,791 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 42 [2025-03-17 11:58:59,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:58:59,792 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2025-03-17 11:58:59,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-17 11:58:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2025-03-17 11:58:59,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 11:58:59,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:58:59,792 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-17 11:58:59,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-17 11:58:59,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:58:59,993 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:58:59,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:58:59,993 INFO L85 PathProgramCache]: Analyzing trace with hash 551181338, now seen corresponding path program 1 times [2025-03-17 11:58:59,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:58:59,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430274136] [2025-03-17 11:58:59,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:58:59,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:00,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:59:00,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:59:00,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:00,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:59:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430274136] [2025-03-17 11:59:00,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430274136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:00,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090292082] [2025-03-17 11:59:00,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:00,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:00,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:00,046 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-17 11:59:00,048 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-17 11:59:00,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:59:00,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:59:00,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:00,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-17 11:59:00,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:00,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:59:00,199 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-17 11:59:00,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090292082] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:00,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:00,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-17 11:59:00,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449546877] [2025-03-17 11:59:00,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:00,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 11:59:00,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:00,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 11:59:00,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:59:00,219 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:59:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:00,268 INFO L93 Difference]: Finished difference Result 234 states and 271 transitions. [2025-03-17 11:59:00,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:59:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2025-03-17 11:59:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:00,269 INFO L225 Difference]: With dead ends: 234 [2025-03-17 11:59:00,269 INFO L226 Difference]: Without dead ends: 234 [2025-03-17 11:59:00,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-17 11:59:00,270 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 53 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:00,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 352 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:00,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-03-17 11:59:00,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 224. [2025-03-17 11:59:00,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 179 states have (on average 1.3687150837988826) internal successors, (245), 207 states have internal predecessors, (245), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2025-03-17 11:59:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 271 transitions. [2025-03-17 11:59:00,277 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 271 transitions. Word has length 45 [2025-03-17 11:59:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:00,277 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 271 transitions. [2025-03-17 11:59:00,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-17 11:59:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 271 transitions. [2025-03-17 11:59:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-17 11:59:00,278 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:00,278 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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-17 11:59:00,288 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-17 11:59:00,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:00,479 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:00,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:00,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1973461100, now seen corresponding path program 1 times [2025-03-17 11:59:00,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:00,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599254447] [2025-03-17 11:59:00,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:00,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:00,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:59:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:59:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,839 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-17 11:59:00,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599254447] [2025-03-17 11:59:00,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599254447] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:00,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357772843] [2025-03-17 11:59:00,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:00,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:00,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:00,841 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-17 11:59:00,842 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-17 11:59:00,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-17 11:59:00,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-17 11:59:00,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:00,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:00,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-17 11:59:01,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:01,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:01,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:01,048 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1)))) is different from true [2025-03-17 11:59:01,102 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:01,103 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-17 11:59:01,115 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 11:59:01,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 11:59:01,162 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (= (store |c_old(#length)| append_~node~0.base (select |c_#length| append_~node~0.base)) |c_#length|) (= (select |c_old(#valid)| append_~node~0.base) 0))) is different from true [2025-03-17 11:59:01,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:01,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-17 11:59:01,227 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 11:59:01,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:59:01,269 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:59:01,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:59:01,310 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2025-03-17 11:59:01,310 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:01,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357772843] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:01,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:01,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-03-17 11:59:01,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921166176] [2025-03-17 11:59:01,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:01,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-17 11:59:01,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:01,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-17 11:59:01,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=318, Unknown=2, NotChecked=74, Total=462 [2025-03-17 11:59:01,514 INFO L87 Difference]: Start difference. First operand 224 states and 271 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:59:02,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:02,208 INFO L93 Difference]: Finished difference Result 255 states and 299 transitions. [2025-03-17 11:59:02,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-17 11:59:02,208 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-03-17 11:59:02,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:02,209 INFO L225 Difference]: With dead ends: 255 [2025-03-17 11:59:02,209 INFO L226 Difference]: Without dead ends: 255 [2025-03-17 11:59:02,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=712, Unknown=3, NotChecked=114, Total=992 [2025-03-17 11:59:02,210 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 259 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:02,210 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 498 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 593 Invalid, 0 Unknown, 271 Unchecked, 0.4s Time] [2025-03-17 11:59:02,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2025-03-17 11:59:02,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 156. [2025-03-17 11:59:02,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 122 states have (on average 1.3278688524590163) internal successors, (162), 146 states have internal predecessors, (162), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-17 11:59:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 177 transitions. [2025-03-17 11:59:02,214 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 177 transitions. Word has length 51 [2025-03-17 11:59:02,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:02,214 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 177 transitions. [2025-03-17 11:59:02,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-17 11:59:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 177 transitions. [2025-03-17 11:59:02,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:59:02,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:02,215 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-17 11:59:02,222 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-17 11:59:02,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:02,415 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:02,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1139229833, now seen corresponding path program 1 times [2025-03-17 11:59:02,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:02,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003089560] [2025-03-17 11:59:02,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:02,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:59:02,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:59:02,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:02,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:02,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003089560] [2025-03-17 11:59:02,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003089560] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:02,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499961558] [2025-03-17 11:59:02,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:02,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:02,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:02,827 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-17 11:59:02,830 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-17 11:59:02,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:59:02,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:59:02,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:02,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:02,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-17 11:59:02,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:03,001 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:03,043 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 19 treesize of output 1 [2025-03-17 11:59:03,079 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-17 11:59:03,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 28 [2025-03-17 11:59:03,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 21 treesize of output 9 [2025-03-17 11:59:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:03,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:03,199 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 40 treesize of output 34 [2025-03-17 11:59:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:03,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499961558] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:03,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:03,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2025-03-17 11:59:03,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950370194] [2025-03-17 11:59:03,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:03,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 11:59:03,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:03,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 11:59:03,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-17 11:59:03,461 INFO L87 Difference]: Start difference. First operand 156 states and 177 transitions. Second operand has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 11:59:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:03,808 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2025-03-17 11:59:03,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-17 11:59:03,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-17 11:59:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:03,811 INFO L225 Difference]: With dead ends: 187 [2025-03-17 11:59:03,811 INFO L226 Difference]: Without dead ends: 187 [2025-03-17 11:59:03,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:59:03,813 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 213 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:03,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 589 Invalid, 655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 11:59:03,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-03-17 11:59:03,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 159. [2025-03-17 11:59:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 126 states have (on average 1.3095238095238095) internal successors, (165), 149 states have internal predecessors, (165), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:59:03,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-03-17 11:59:03,819 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 57 [2025-03-17 11:59:03,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:03,819 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-03-17 11:59:03,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 11:59:03,819 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-03-17 11:59:03,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-17 11:59:03,819 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:03,820 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-17 11:59:03,827 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-17 11:59:04,020 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,SelfDestructingSolverStorable21 [2025-03-17 11:59:04,020 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:04,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:04,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1139229832, now seen corresponding path program 1 times [2025-03-17 11:59:04,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:04,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355311840] [2025-03-17 11:59:04,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:04,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:59:04,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:59:04,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:04,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:05,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:05,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355311840] [2025-03-17 11:59:05,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355311840] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:05,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [39215013] [2025-03-17 11:59:05,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:05,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:05,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:05,301 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-17 11:59:05,302 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-17 11:59:05,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:59:05,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:59:05,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:05,457 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-17 11:59:05,459 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:05,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:05,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:05,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:59:05,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-17 11:59:05,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 11:59:05,698 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-17 11:59:05,699 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 15 treesize of output 15 [2025-03-17 11:59:05,702 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 18 treesize of output 13 [2025-03-17 11:59:05,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 12 [2025-03-17 11:59:05,801 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:05,801 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:06,082 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 34 treesize of output 28 [2025-03-17 11:59:06,093 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 76 treesize of output 70 [2025-03-17 11:59:06,165 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 104 treesize of output 98 [2025-03-17 11:59:06,311 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 44 treesize of output 38 [2025-03-17 11:59:06,433 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 44 treesize of output 38 [2025-03-17 11:59:06,539 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 44 treesize of output 38 [2025-03-17 11:59:06,636 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 44 treesize of output 38 [2025-03-17 11:59:06,733 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 44 treesize of output 38 [2025-03-17 11:59:06,845 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 44 treesize of output 38 [2025-03-17 11:59:06,939 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 44 treesize of output 38 [2025-03-17 11:59:07,043 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:59:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [39215013] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:07,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:07,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 6] total 40 [2025-03-17 11:59:07,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250425478] [2025-03-17 11:59:07,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:07,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 11:59:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:07,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 11:59:07,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1519, Unknown=0, NotChecked=0, Total=1640 [2025-03-17 11:59:07,045 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 11:59:09,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:09,395 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2025-03-17 11:59:09,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-17 11:59:09,396 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-17 11:59:09,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:09,397 INFO L225 Difference]: With dead ends: 271 [2025-03-17 11:59:09,397 INFO L226 Difference]: Without dead ends: 271 [2025-03-17 11:59:09,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1806 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=844, Invalid=5636, Unknown=0, NotChecked=0, Total=6480 [2025-03-17 11:59:09,399 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 741 mSDsluCounter, 1022 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 1891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:09,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1074 Invalid, 1891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 11:59:09,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-17 11:59:09,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 158. [2025-03-17 11:59:09,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 126 states have (on average 1.3015873015873016) internal successors, (164), 148 states have internal predecessors, (164), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-17 11:59:09,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 176 transitions. [2025-03-17 11:59:09,405 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 176 transitions. Word has length 57 [2025-03-17 11:59:09,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:09,405 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 176 transitions. [2025-03-17 11:59:09,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-17 11:59:09,406 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 176 transitions. [2025-03-17 11:59:09,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-17 11:59:09,406 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:09,406 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:09,413 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-17 11:59:09,606 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,SelfDestructingSolverStorable22 [2025-03-17 11:59:09,607 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:09,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:09,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1712561515, now seen corresponding path program 2 times [2025-03-17 11:59:09,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:09,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151579206] [2025-03-17 11:59:09,607 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:09,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:09,627 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 11:59:09,638 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:59:09,638 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:09,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:09,725 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 11:59:09,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:09,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151579206] [2025-03-17 11:59:09,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151579206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:09,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841098189] [2025-03-17 11:59:09,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:59:09,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:09,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:09,727 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-17 11:59:09,729 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-17 11:59:09,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-03-17 11:59:10,124 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-03-17 11:59:10,124 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:59:10,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:10,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 11:59:10,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 11:59:10,146 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:10,200 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-03-17 11:59:10,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841098189] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:59:10,201 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:59:10,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-17 11:59:10,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907559396] [2025-03-17 11:59:10,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:10,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 11:59:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:10,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 11:59:10,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:10,201 INFO L87 Difference]: Start difference. First operand 158 states and 176 transitions. Second operand has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 11:59:10,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:10,241 INFO L93 Difference]: Finished difference Result 196 states and 206 transitions. [2025-03-17 11:59:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 11:59:10,241 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Word has length 96 [2025-03-17 11:59:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:10,242 INFO L225 Difference]: With dead ends: 196 [2025-03-17 11:59:10,242 INFO L226 Difference]: Without dead ends: 196 [2025-03-17 11:59:10,242 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-17 11:59:10,242 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 112 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:10,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 269 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 11:59:10,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-03-17 11:59:10,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2025-03-17 11:59:10,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 142 states have (on average 1.3380281690140845) internal successors, (190), 164 states have internal predecessors, (190), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:59:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 206 transitions. [2025-03-17 11:59:10,247 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 206 transitions. Word has length 96 [2025-03-17 11:59:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:10,247 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 206 transitions. [2025-03-17 11:59:10,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-17 11:59:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 206 transitions. [2025-03-17 11:59:10,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-17 11:59:10,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:10,248 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:10,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-17 11:59:10,448 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-17 11:59:10,449 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:10,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:10,449 INFO L85 PathProgramCache]: Analyzing trace with hash 795792693, now seen corresponding path program 3 times [2025-03-17 11:59:10,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:10,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561095590] [2025-03-17 11:59:10,449 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:59:10,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:10,477 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 7 equivalence classes. [2025-03-17 11:59:10,487 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 130 statements. [2025-03-17 11:59:10,487 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:59:10,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:10,751 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 161 proven. 13 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 11:59:10,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561095590] [2025-03-17 11:59:10,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561095590] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:10,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686313094] [2025-03-17 11:59:10,752 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:59:10,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:10,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:10,754 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-17 11:59:10,755 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-17 11:59:10,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 130 statements into 7 equivalence classes. [2025-03-17 11:59:12,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 130 statements. [2025-03-17 11:59:12,659 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-17 11:59:12,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:12,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-17 11:59:12,665 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:12,757 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 19 treesize of output 1 [2025-03-17 11:59:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 161 proven. 13 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-17 11:59:12,982 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:13,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686313094] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:13,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:13,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2025-03-17 11:59:13,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792185525] [2025-03-17 11:59:13,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:13,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-17 11:59:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:13,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-17 11:59:13,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=528, Unknown=0, NotChecked=0, Total=600 [2025-03-17 11:59:13,054 INFO L87 Difference]: Start difference. First operand 176 states and 206 transitions. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 11:59:15,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:59:19,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:59:21,977 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:59:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:32,505 INFO L93 Difference]: Finished difference Result 169 states and 197 transitions. [2025-03-17 11:59:32,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-17 11:59:32,505 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 130 [2025-03-17 11:59:32,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:32,506 INFO L225 Difference]: With dead ends: 169 [2025-03-17 11:59:32,506 INFO L226 Difference]: Without dead ends: 169 [2025-03-17 11:59:32,507 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=300, Invalid=1501, Unknown=5, NotChecked=0, Total=1806 [2025-03-17 11:59:32,507 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 149 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 11 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:32,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 949 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 594 Invalid, 2 Unknown, 0 Unchecked, 7.2s Time] [2025-03-17 11:59:32,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2025-03-17 11:59:32,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2025-03-17 11:59:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 135 states have (on average 1.3407407407407408) internal successors, (181), 157 states have internal predecessors, (181), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:59:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2025-03-17 11:59:32,510 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 130 [2025-03-17 11:59:32,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:32,510 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-03-17 11:59:32,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 23 states have internal predecessors, (95), 4 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-17 11:59:32,510 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2025-03-17 11:59:32,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 11:59:32,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:32,511 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:32,524 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-17 11:59:32,712 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-17 11:59:32,712 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:32,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:32,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1997552732, now seen corresponding path program 1 times [2025-03-17 11:59:32,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:32,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168487860] [2025-03-17 11:59:32,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:32,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:32,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:59:32,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:59:32,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:32,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:33,395 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 153 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-17 11:59:33,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168487860] [2025-03-17 11:59:33,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168487860] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:33,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836708334] [2025-03-17 11:59:33,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:33,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:33,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:33,398 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-17 11:59:33,399 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-17 11:59:33,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:59:33,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:59:33,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:33,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:33,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-03-17 11:59:33,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:33,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:59:33,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 30 [2025-03-17 11:59:33,845 INFO L349 Elim1Store]: treesize reduction 32, result has 30.4 percent of original size [2025-03-17 11:59:33,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 20 [2025-03-17 11:59:34,049 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-17 11:59:34,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-03-17 11:59:34,055 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 20 [2025-03-17 11:59:34,254 INFO L349 Elim1Store]: treesize reduction 162, result has 28.9 percent of original size [2025-03-17 11:59:34,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 57 treesize of output 78 [2025-03-17 11:59:34,261 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 46 [2025-03-17 11:59:34,442 INFO L349 Elim1Store]: treesize reduction 92, result has 37.0 percent of original size [2025-03-17 11:59:34,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 63 [2025-03-17 11:59:34,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 39 [2025-03-17 11:59:34,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 50 [2025-03-17 11:59:34,710 INFO L349 Elim1Store]: treesize reduction 80, result has 48.1 percent of original size [2025-03-17 11:59:34,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 105 [2025-03-17 11:59:34,981 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:59:34,981 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 43 [2025-03-17 11:59:35,021 INFO L349 Elim1Store]: treesize reduction 30, result has 59.5 percent of original size [2025-03-17 11:59:35,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 76 [2025-03-17 11:59:35,313 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 45 proven. 237 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-17 11:59:35,313 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:35,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836708334] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:35,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:35,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28] total 34 [2025-03-17 11:59:35,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307668860] [2025-03-17 11:59:35,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:35,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:59:35,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:35,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:59:35,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2025-03-17 11:59:35,390 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 33 states have internal predecessors, (165), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-17 11:59:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:36,143 INFO L93 Difference]: Finished difference Result 206 states and 234 transitions. [2025-03-17 11:59:36,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:59:36,144 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 33 states have internal predecessors, (165), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 140 [2025-03-17 11:59:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:36,145 INFO L225 Difference]: With dead ends: 206 [2025-03-17 11:59:36,145 INFO L226 Difference]: Without dead ends: 206 [2025-03-17 11:59:36,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1936, Unknown=0, NotChecked=0, Total=2256 [2025-03-17 11:59:36,146 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 137 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:36,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 812 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 11:59:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2025-03-17 11:59:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 168. [2025-03-17 11:59:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 135 states have (on average 1.3333333333333333) internal successors, (180), 156 states have internal predecessors, (180), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:59:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2025-03-17 11:59:36,151 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 140 [2025-03-17 11:59:36,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:36,151 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2025-03-17 11:59:36,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 4.852941176470588) internal successors, (165), 33 states have internal predecessors, (165), 6 states have call successors, (6), 3 states have call predecessors, (6), 9 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-17 11:59:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2025-03-17 11:59:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-17 11:59:36,152 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:36,153 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:59:36,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-17 11:59:36,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:36,353 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:36,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:36,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1997552733, now seen corresponding path program 1 times [2025-03-17 11:59:36,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:36,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468653247] [2025-03-17 11:59:36,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:36,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:36,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:59:36,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:59:36,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:36,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:37,565 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 24 proven. 224 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-17 11:59:37,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468653247] [2025-03-17 11:59:37,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468653247] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:37,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052977150] [2025-03-17 11:59:37,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:37,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:37,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:37,570 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-17 11:59:37,571 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-17 11:59:37,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:59:37,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:59:37,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:37,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:37,888 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 124 conjuncts are in the unsatisfiable core [2025-03-17 11:59:37,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:38,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-17 11:59:38,113 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-17 11:59:38,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-03-17 11:59:38,121 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 26 treesize of output 9 [2025-03-17 11:59:38,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 10 [2025-03-17 11:59:38,306 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-17 11:59:38,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 30 [2025-03-17 11:59:38,310 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 26 treesize of output 9 [2025-03-17 11:59:38,481 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 10 treesize of output 4 [2025-03-17 11:59:38,491 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:59:38,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 11:59:38,623 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 19 treesize of output 1 [2025-03-17 11:59:38,629 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 19 treesize of output 1 [2025-03-17 11:59:38,674 INFO L349 Elim1Store]: treesize reduction 48, result has 44.8 percent of original size [2025-03-17 11:59:38,675 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 50 [2025-03-17 11:59:38,953 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 40 treesize of output 28 [2025-03-17 11:59:38,956 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 23 treesize of output 11 [2025-03-17 11:59:38,967 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 11:59:38,967 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 23 treesize of output 20 [2025-03-17 11:59:39,100 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-03-17 11:59:39,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 38 [2025-03-17 11:59:39,149 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 36 proven. 256 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-17 11:59:39,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:39,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052977150] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:39,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:39,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 26] total 39 [2025-03-17 11:59:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [23267122] [2025-03-17 11:59:39,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:39,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-17 11:59:39,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:39,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-17 11:59:39,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=1549, Unknown=0, NotChecked=0, Total=1722 [2025-03-17 11:59:39,250 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 40 states, 39 states have (on average 5.282051282051282) internal successors, (206), 34 states have internal predecessors, (206), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-17 11:59:43,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 11:59:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:44,127 INFO L93 Difference]: Finished difference Result 193 states and 221 transitions. [2025-03-17 11:59:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:59:44,127 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.282051282051282) internal successors, (206), 34 states have internal predecessors, (206), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) Word has length 140 [2025-03-17 11:59:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:44,128 INFO L225 Difference]: With dead ends: 193 [2025-03-17 11:59:44,128 INFO L226 Difference]: Without dead ends: 193 [2025-03-17 11:59:44,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1114 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=439, Invalid=2983, Unknown=0, NotChecked=0, Total=3422 [2025-03-17 11:59:44,129 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 537 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 32 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:44,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [537 Valid, 596 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 669 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-03-17 11:59:44,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-03-17 11:59:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 167. [2025-03-17 11:59:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 135 states have (on average 1.325925925925926) internal successors, (179), 155 states have internal predecessors, (179), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:59:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 195 transitions. [2025-03-17 11:59:44,132 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 195 transitions. Word has length 140 [2025-03-17 11:59:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:44,132 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 195 transitions. [2025-03-17 11:59:44,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.282051282051282) internal successors, (206), 34 states have internal predecessors, (206), 8 states have call successors, (8), 6 states have call predecessors, (8), 10 states have return successors, (13), 7 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-17 11:59:44,132 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 195 transitions. [2025-03-17 11:59:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 11:59:44,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:44,133 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-17 11:59:44,142 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-17 11:59:44,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-17 11:59:44,333 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:44,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:44,334 INFO L85 PathProgramCache]: Analyzing trace with hash -202205223, now seen corresponding path program 1 times [2025-03-17 11:59:44,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:44,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656551240] [2025-03-17 11:59:44,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:44,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:44,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:59:44,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:59:44,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:44,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:45,982 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 8 proven. 96 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-17 11:59:45,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:45,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656551240] [2025-03-17 11:59:45,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656551240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:45,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379457742] [2025-03-17 11:59:45,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:45,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:45,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:45,984 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-17 11:59:45,985 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-17 11:59:46,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:59:46,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:59:46,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:46,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:46,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 151 conjuncts are in the unsatisfiable core [2025-03-17 11:59:46,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:46,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:46,358 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:59:46,358 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-17 11:59:46,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:46,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:59:46,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 11:59:46,545 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2025-03-17 11:59:46,591 INFO L349 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2025-03-17 11:59:46,591 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 22 treesize of output 24 [2025-03-17 11:59:46,595 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 18 treesize of output 13 [2025-03-17 11:59:46,872 INFO L349 Elim1Store]: treesize reduction 135, result has 22.9 percent of original size [2025-03-17 11:59:46,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 49 [2025-03-17 11:59:46,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 38 [2025-03-17 11:59:47,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 21 [2025-03-17 11:59:47,077 INFO L349 Elim1Store]: treesize reduction 68, result has 36.4 percent of original size [2025-03-17 11:59:47,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 45 [2025-03-17 11:59:47,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2025-03-17 11:59:47,281 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-03-17 11:59:47,281 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 38 treesize of output 35 [2025-03-17 11:59:47,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 22 [2025-03-17 11:59:47,423 INFO L349 Elim1Store]: treesize reduction 56, result has 47.7 percent of original size [2025-03-17 11:59:47,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 65 [2025-03-17 11:59:47,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 32 [2025-03-17 11:59:47,650 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 31 treesize of output 23 [2025-03-17 11:59:47,671 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-03-17 11:59:47,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 54 [2025-03-17 11:59:47,706 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 17 treesize of output 9 [2025-03-17 11:59:47,709 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 34 proven. 218 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-17 11:59:47,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:47,762 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_append_~node~0.base_115 Int) (v_ArrVal_4808 (Array Int Int))) (let ((.cse0 (store |c_#valid| v_append_~node~0.base_115 1))) (or (= (select .cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_4808) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) 1) (not (= (select .cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) 1))))) is different from false [2025-03-17 11:59:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [379457742] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:47,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:47,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 32] total 41 [2025-03-17 11:59:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324006525] [2025-03-17 11:59:47,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:47,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-17 11:59:47,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-17 11:59:47,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1554, Unknown=1, NotChecked=80, Total=1806 [2025-03-17 11:59:47,766 INFO L87 Difference]: Start difference. First operand 167 states and 195 transitions. Second operand has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-17 11:59:48,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 11:59:48,866 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2025-03-17 11:59:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-17 11:59:48,866 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 142 [2025-03-17 11:59:48,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 11:59:48,867 INFO L225 Difference]: With dead ends: 186 [2025-03-17 11:59:48,867 INFO L226 Difference]: Without dead ends: 186 [2025-03-17 11:59:48,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1198 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=472, Invalid=3563, Unknown=1, NotChecked=124, Total=4160 [2025-03-17 11:59:48,868 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 286 mSDsluCounter, 813 mSDsCounter, 0 mSdLazyCounter, 1368 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-17 11:59:48,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 868 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1368 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-17 11:59:48,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2025-03-17 11:59:48,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 165. [2025-03-17 11:59:48,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 136 states have (on average 1.2720588235294117) internal successors, (173), 153 states have internal predecessors, (173), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 11:59:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 189 transitions. [2025-03-17 11:59:48,871 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 189 transitions. Word has length 142 [2025-03-17 11:59:48,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 11:59:48,872 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 189 transitions. [2025-03-17 11:59:48,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.3658536585365852) internal successors, (138), 41 states have internal predecessors, (138), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2025-03-17 11:59:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 189 transitions. [2025-03-17 11:59:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-17 11:59:48,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 11:59:48,873 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2025-03-17 11:59:48,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-17 11:59:49,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-17 11:59:49,073 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 11:59:49,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:59:49,074 INFO L85 PathProgramCache]: Analyzing trace with hash -202205222, now seen corresponding path program 1 times [2025-03-17 11:59:49,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:59:49,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028295054] [2025-03-17 11:59:49,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:49,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:59:49,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:59:49,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:59:49,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:49,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:51,407 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 146 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-17 11:59:51,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:59:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028295054] [2025-03-17 11:59:51,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028295054] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:51,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673807191] [2025-03-17 11:59:51,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:59:51,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:59:51,408 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:59:51,409 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-17 11:59:51,410 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-17 11:59:51,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:59:51,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:59:51,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:59:51,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:59:51,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 211 conjuncts are in the unsatisfiable core [2025-03-17 11:59:51,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:59:51,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:51,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:59:51,765 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-17 11:59:51,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:51,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 11:59:51,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 11:59:51,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 11:59:51,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-03-17 11:59:51,876 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-17 11:59:52,049 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2025-03-17 11:59:52,102 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 16 treesize of output 11 [2025-03-17 11:59:52,115 INFO L349 Elim1Store]: treesize reduction 42, result has 36.4 percent of original size [2025-03-17 11:59:52,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 41 [2025-03-17 11:59:52,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 41 treesize of output 32 [2025-03-17 11:59:52,123 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 30 treesize of output 13 [2025-03-17 11:59:52,426 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 16 treesize of output 11 [2025-03-17 11:59:52,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 32 [2025-03-17 11:59:52,440 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-03-17 11:59:52,440 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 30 treesize of output 27 [2025-03-17 11:59:52,448 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:59:52,463 INFO L349 Elim1Store]: treesize reduction 61, result has 35.8 percent of original size [2025-03-17 11:59:52,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 38 treesize of output 54 [2025-03-17 11:59:52,769 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 16 treesize of output 11 [2025-03-17 11:59:52,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:52,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-03-17 11:59:52,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 35 [2025-03-17 11:59:52,790 INFO L349 Elim1Store]: treesize reduction 12, result has 74.5 percent of original size [2025-03-17 11:59:52,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 47 [2025-03-17 11:59:52,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 11:59:53,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 17 [2025-03-17 11:59:53,053 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-03-17 11:59:53,053 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 30 treesize of output 27 [2025-03-17 11:59:53,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 11:59:53,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:53,362 INFO L349 Elim1Store]: treesize reduction 51, result has 31.1 percent of original size [2025-03-17 11:59:53,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2025-03-17 11:59:53,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 33 [2025-03-17 11:59:53,380 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-17 11:59:53,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 33 [2025-03-17 11:59:53,390 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 16 treesize of output 11 [2025-03-17 11:59:53,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2025-03-17 11:59:53,709 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 16 treesize of output 11 [2025-03-17 11:59:53,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:53,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:59:53,723 INFO L349 Elim1Store]: treesize reduction 49, result has 25.8 percent of original size [2025-03-17 11:59:53,723 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 41 [2025-03-17 11:59:53,726 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 27 treesize of output 15 [2025-03-17 11:59:53,738 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-17 11:59:53,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2025-03-17 11:59:53,821 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 17 treesize of output 9 [2025-03-17 11:59:53,918 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 66 proven. 224 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-17 11:59:53,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:59:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673807191] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:59:54,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 11:59:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 33] total 46 [2025-03-17 11:59:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335328470] [2025-03-17 11:59:54,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 11:59:54,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-03-17 11:59:54,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:59:54,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-03-17 11:59:54,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2315, Unknown=3, NotChecked=0, Total=2550 [2025-03-17 11:59:54,158 INFO L87 Difference]: Start difference. First operand 165 states and 189 transitions. Second operand has 47 states, 46 states have (on average 4.0) internal successors, (184), 45 states have internal predecessors, (184), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-17 11:59:58,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:00:03,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-17 12:00:04,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:04,216 INFO L93 Difference]: Finished difference Result 195 states and 218 transitions. [2025-03-17 12:00:04,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-17 12:00:04,216 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 4.0) internal successors, (184), 45 states have internal predecessors, (184), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) Word has length 142 [2025-03-17 12:00:04,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:04,217 INFO L225 Difference]: With dead ends: 195 [2025-03-17 12:00:04,217 INFO L226 Difference]: Without dead ends: 195 [2025-03-17 12:00:04,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1707 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=648, Invalid=5201, Unknown=3, NotChecked=0, Total=5852 [2025-03-17 12:00:04,219 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 330 mSDsluCounter, 1168 mSDsCounter, 0 mSdLazyCounter, 1764 mSolverCounterSat, 16 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1226 SdHoareTripleChecker+Invalid, 1782 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1764 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:04,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1226 Invalid, 1782 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1764 Invalid, 2 Unknown, 0 Unchecked, 9.1s Time] [2025-03-17 12:00:04,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-17 12:00:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 166. [2025-03-17 12:00:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.2536231884057971) internal successors, (173), 154 states have internal predecessors, (173), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:00:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 189 transitions. [2025-03-17 12:00:04,225 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 189 transitions. Word has length 142 [2025-03-17 12:00:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:04,225 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 189 transitions. [2025-03-17 12:00:04,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 4.0) internal successors, (184), 45 states have internal predecessors, (184), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (11), 9 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-17 12:00:04,226 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 189 transitions. [2025-03-17 12:00:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-17 12:00:04,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:04,227 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-17 12:00:04,237 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-17 12:00:04,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-17 12:00:04,428 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 12:00:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -767052506, now seen corresponding path program 1 times [2025-03-17 12:00:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7069183] [2025-03-17 12:00:04,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:04,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:04,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 12:00:04,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 12:00:04,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:04,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:04,814 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 74 proven. 11 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-17 12:00:04,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7069183] [2025-03-17 12:00:04,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7069183] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:04,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837565302] [2025-03-17 12:00:04,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:04,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:04,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:04,816 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-17 12:00:04,817 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-17 12:00:05,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 12:00:05,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 12:00:05,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:05,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:05,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 1226 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 12:00:05,161 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:05,168 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-17 12:00:05,182 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-17 12:00:05,196 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (not (= append_~node~0.base 0)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2025-03-17 12:00:05,222 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-17 12:00:05,255 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-17 12:00:05,294 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-17 12:00:05,339 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-17 12:00:05,383 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-17 12:00:05,419 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-17 12:00:05,456 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-17 12:00:05,463 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:00:05,464 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-17 12:00:05,472 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2025-03-17 12:00:05,472 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 12:00:05,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837565302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:00:05,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 12:00:05,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2025-03-17 12:00:05,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324624001] [2025-03-17 12:00:05,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:00:05,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:00:05,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:05,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:00:05,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=111, Unknown=1, NotChecked=20, Total=156 [2025-03-17 12:00:05,473 INFO L87 Difference]: Start difference. First operand 166 states and 189 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-17 12:00:05,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:05,565 INFO L93 Difference]: Finished difference Result 165 states and 187 transitions. [2025-03-17 12:00:05,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:00:05,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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 147 [2025-03-17 12:00:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:05,566 INFO L225 Difference]: With dead ends: 165 [2025-03-17 12:00:05,567 INFO L226 Difference]: Without dead ends: 165 [2025-03-17 12:00:05,567 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=175, Unknown=3, NotChecked=26, Total=240 [2025-03-17 12:00:05,567 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:05,567 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 109 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2025-03-17 12:00:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2025-03-17 12:00:05,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2025-03-17 12:00:05,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 137 states have (on average 1.2481751824817517) internal successors, (171), 153 states have internal predecessors, (171), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:00:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 187 transitions. [2025-03-17 12:00:05,571 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 187 transitions. Word has length 147 [2025-03-17 12:00:05,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:05,571 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 187 transitions. [2025-03-17 12:00:05,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 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-17 12:00:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 187 transitions. [2025-03-17 12:00:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-17 12:00:05,572 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:05,572 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-17 12:00:05,584 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-17 12:00:05,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:05,773 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 12:00:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1990560436, now seen corresponding path program 1 times [2025-03-17 12:00:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775985585] [2025-03-17 12:00:05,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:05,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:05,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 12:00:05,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 12:00:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:06,570 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 59 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2025-03-17 12:00:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:00:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775985585] [2025-03-17 12:00:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775985585] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:06,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693578460] [2025-03-17 12:00:06,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:06,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:00:06,573 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-17 12:00:06,573 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-17 12:00:06,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-17 12:00:06,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-17 12:00:06,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:06,925 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:00:06,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1225 conjuncts, 65 conjuncts are in the unsatisfiable core [2025-03-17 12:00:06,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:00:06,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:00:06,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:00:06,948 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-17 12:00:06,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:00:06,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-17 12:00:07,012 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 9 treesize of output 5 [2025-03-17 12:00:07,060 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 9 treesize of output 5 [2025-03-17 12:00:07,103 WARN L851 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2025-03-17 12:00:07,104 WARN L873 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2025-03-17 12:00:07,113 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 9 treesize of output 5 [2025-03-17 12:00:07,166 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 9 treesize of output 5 [2025-03-17 12:00:07,224 WARN L851 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2025-03-17 12:00:07,226 WARN L873 $PredicateComparison]: unable to prove that (and (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse0) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2025-03-17 12:00:07,238 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 9 treesize of output 5 [2025-03-17 12:00:07,295 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_#memory_$Pointer$#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~list2~0#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2025-03-17 12:00:07,297 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_#memory_$Pointer$#1.base|))) (and (= .cse0 |c_ULTIMATE.start_main_~list2~0#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2025-03-17 12:00:07,310 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 9 treesize of output 5 [2025-03-17 12:00:07,354 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 17 treesize of output 9 [2025-03-17 12:00:07,361 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 231 trivial. 12 not checked. [2025-03-17 12:00:07,361 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:00:07,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693578460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:00:07,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-17 12:00:07,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 19 [2025-03-17 12:00:07,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888235846] [2025-03-17 12:00:07,430 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-17 12:00:07,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-17 12:00:07,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:00:07,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-17 12:00:07,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=253, Unknown=11, NotChecked=102, Total=420 [2025-03-17 12:00:07,431 INFO L87 Difference]: Start difference. First operand 165 states and 187 transitions. Second operand has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:00:07,656 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (< .cse4 |c_#StackHeapBarrier|))) (and (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_#memory_$Pointer$#1.base|))) (and (= .cse3 |c_ULTIMATE.start_main_~list2~0#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)))))) .cse0) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from false [2025-03-17 12:00:07,659 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (< .cse4 |c_#StackHeapBarrier|))) (and (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse1) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_77| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_#memory_$Pointer$#1.base|))) (and (= |c_ULTIMATE.start_main_~list2~0#1.base| .cse2) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_75| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_#memory_$Pointer$#1.base|))) (and (= .cse3 |c_ULTIMATE.start_main_~list2~0#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_78| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3)))))) .cse0) (<= (+ .cse4 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from true [2025-03-17 12:00:07,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:00:07,779 INFO L93 Difference]: Finished difference Result 167 states and 189 transitions. [2025-03-17 12:00:07,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-17 12:00:07,780 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Word has length 148 [2025-03-17 12:00:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:00:07,781 INFO L225 Difference]: With dead ends: 167 [2025-03-17 12:00:07,781 INFO L226 Difference]: Without dead ends: 167 [2025-03-17 12:00:07,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 166 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=627, Unknown=13, NotChecked=220, Total=992 [2025-03-17 12:00:07,781 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 132 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:00:07,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 353 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 422 Invalid, 0 Unknown, 341 Unchecked, 0.2s Time] [2025-03-17 12:00:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2025-03-17 12:00:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2025-03-17 12:00:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 138 states have (on average 1.2463768115942029) internal successors, (172), 154 states have internal predecessors, (172), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-17 12:00:07,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 188 transitions. [2025-03-17 12:00:07,784 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 188 transitions. Word has length 148 [2025-03-17 12:00:07,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:00:07,784 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 188 transitions. [2025-03-17 12:00:07,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 16 states have internal predecessors, (69), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2025-03-17 12:00:07,784 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 188 transitions. [2025-03-17 12:00:07,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-17 12:00:07,786 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:00:07,786 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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-17 12:00:07,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-03-17 12:00:07,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:00:07,987 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-17 12:00:07,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:00:07,988 INFO L85 PathProgramCache]: Analyzing trace with hash 172497293, now seen corresponding path program 1 times [2025-03-17 12:00:07,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:00:07,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157975747] [2025-03-17 12:00:07,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:00:07,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:00:08,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 12:00:08,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 12:00:08,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:00:08,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat