./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-798a7b3-m [2025-03-04 07:39:38,915 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:39:38,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:39:38,994 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:39:38,995 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:39:39,024 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:39:39,025 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:39:39,026 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:39:39,026 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:39:39,026 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:39:39,027 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:39:39,027 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:39:39,027 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:39:39,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:39:39,027 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:39:39,028 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:39:39,028 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:39:39,028 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:39:39,028 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:39:39,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:39:39,029 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:39:39,029 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:39:39,029 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:39:39,029 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:39:39,029 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-04 07:39:39,262 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:39:39,269 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:39:39,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:39:39,272 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:39:39,272 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:39:39,273 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-04 07:39:40,415 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc339430f/2385900a84a14d2984cc166b35adf808/FLAG6fea0c274 [2025-03-04 07:39:40,715 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:39:40,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-2.i [2025-03-04 07:39:40,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc339430f/2385900a84a14d2984cc166b35adf808/FLAG6fea0c274 [2025-03-04 07:39:41,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cc339430f/2385900a84a14d2984cc166b35adf808 [2025-03-04 07:39:41,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:39:41,007 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:39:41,008 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:39:41,008 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:39:41,011 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:39:41,012 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,012 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@350ce49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41, skipping insertion in model container [2025-03-04 07:39:41,013 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,031 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:39:41,246 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:39:41,259 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:39:41,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:39:41,312 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:39:41,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41 WrapperNode [2025-03-04 07:39:41,313 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:39:41,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:39:41,314 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:39:41,314 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:39:41,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,325 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,338 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 91 [2025-03-04 07:39:41,339 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:39:41,339 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:39:41,340 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:39:41,340 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:39:41,345 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,346 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,359 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-04 07:39:41,359 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,359 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,367 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,369 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,370 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,373 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:39:41,374 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:39:41,374 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:39:41,374 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:39:41,375 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (1/1) ... [2025-03-04 07:39:41,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:39:41,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:41,406 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:39:41,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 07:39:41,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:39:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:39:41,426 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-03-04 07:39:41,426 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-03-04 07:39:41,500 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:39:41,502 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:39:41,818 INFO L? ?]: Removed 127 outVars from TransFormulas that were not future-live. [2025-03-04 07:39:41,819 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:39:41,830 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:39:41,830 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:39:41,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:39:41 BoogieIcfgContainer [2025-03-04 07:39:41,831 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:39:41,832 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:39:41,832 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:39:41,835 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:39:41,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:39:41" (1/3) ... [2025-03-04 07:39:41,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28489d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:39:41, skipping insertion in model container [2025-03-04 07:39:41,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:39:41" (2/3) ... [2025-03-04 07:39:41,836 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28489d2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:39:41, skipping insertion in model container [2025-03-04 07:39:41,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:39:41" (3/3) ... [2025-03-04 07:39:41,839 INFO L128 eAbstractionObserver]: Analyzing ICFG length_test03-2.i [2025-03-04 07:39:41,851 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:39:41,852 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG length_test03-2.i that has 2 procedures, 126 locations, 1 initial locations, 4 loop locations, and 59 error locations. [2025-03-04 07:39:41,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:39:41,884 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;@5072aa9b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:39:41,884 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-03-04 07:39:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand has 126 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 122 states have internal predecessors, (129), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:39:41,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:41,891 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:39:41,891 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-04 07:39:41,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:41,895 INFO L85 PathProgramCache]: Analyzing trace with hash 110190, now seen corresponding path program 1 times [2025-03-04 07:39:41,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:41,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-03-04 07:39:41,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:41,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:41,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:39:41,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:39:41,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:41,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:42,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:42,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:42,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578157382] [2025-03-04 07:39:42,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578157382] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:42,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:42,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:42,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084699923] [2025-03-04 07:39:42,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:42,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:42,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:42,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:42,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,054 INFO L87 Difference]: Start difference. First operand has 126 states, 63 states have (on average 2.0476190476190474) internal successors, (129), 122 states have internal predecessors, (129), 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.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:42,169 INFO L93 Difference]: Finished difference Result 162 states and 171 transitions. [2025-03-04 07:39:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:42,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:39:42,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:42,175 INFO L225 Difference]: With dead ends: 162 [2025-03-04 07:39:42,176 INFO L226 Difference]: Without dead ends: 160 [2025-03-04 07:39:42,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,178 INFO L435 NwaCegarLoop]: 105 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:42,179 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 164 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-03-04 07:39:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 122. [2025-03-04 07:39:42,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 62 states have (on average 2.0) internal successors, (124), 118 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-04 07:39:42,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2025-03-04 07:39:42,215 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 3 [2025-03-04 07:39:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:42,215 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2025-03-04 07:39:42,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2025-03-04 07:39:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-04 07:39:42,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:42,216 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-04 07:39:42,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:39:42,216 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-04 07:39:42,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:42,216 INFO L85 PathProgramCache]: Analyzing trace with hash 110191, now seen corresponding path program 1 times [2025-03-04 07:39:42,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:42,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780526614] [2025-03-04 07:39:42,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:42,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:42,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 07:39:42,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 07:39:42,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:42,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:42,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-04 07:39:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780526614] [2025-03-04 07:39:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780526614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807648579] [2025-03-04 07:39:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:42,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:42,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,285 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:42,373 INFO L93 Difference]: Finished difference Result 122 states and 129 transitions. [2025-03-04 07:39:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:42,375 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-04 07:39:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:42,375 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:39:42,376 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:39:42,376 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,376 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:42,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 185 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:42,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:39:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-04 07:39:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 62 states have (on average 1.967741935483871) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:42,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2025-03-04 07:39:42,386 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 3 [2025-03-04 07:39:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:42,386 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2025-03-04 07:39:42,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,387 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2025-03-04 07:39:42,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:39:42,387 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:42,387 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:39:42,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:39:42,388 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-04 07:39:42,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:42,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1012253349, now seen corresponding path program 1 times [2025-03-04 07:39:42,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:42,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-03-04 07:39:42,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:42,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:42,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:39:42,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:39:42,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:42,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:42,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:42,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999483817] [2025-03-04 07:39:42,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999483817] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:42,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:42,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:42,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537608685] [2025-03-04 07:39:42,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:42,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:42,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:42,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:42,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,488 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:42,568 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2025-03-04 07:39:42,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:42,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-04 07:39:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:42,570 INFO L225 Difference]: With dead ends: 135 [2025-03-04 07:39:42,571 INFO L226 Difference]: Without dead ends: 135 [2025-03-04 07:39:42,571 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,572 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:42,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 169 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:42,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-03-04 07:39:42,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 122. [2025-03-04 07:39:42,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 66 states have (on average 1.9242424242424243) internal successors, (127), 118 states have internal predecessors, (127), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:42,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2025-03-04 07:39:42,579 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 6 [2025-03-04 07:39:42,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:42,579 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2025-03-04 07:39:42,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,579 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2025-03-04 07:39:42,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:39:42,579 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:42,579 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:39:42,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:39:42,580 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-04 07:39:42,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:42,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1012253348, now seen corresponding path program 1 times [2025-03-04 07:39:42,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:42,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185805662] [2025-03-04 07:39:42,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:42,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:42,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:39:42,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:39:42,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:42,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:42,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:42,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185805662] [2025-03-04 07:39:42,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185805662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:42,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:42,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:42,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111604891] [2025-03-04 07:39:42,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:42,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:42,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:42,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:42,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,648 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:42,726 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2025-03-04 07:39:42,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:42,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2025-03-04 07:39:42,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:42,736 INFO L225 Difference]: With dead ends: 122 [2025-03-04 07:39:42,736 INFO L226 Difference]: Without dead ends: 122 [2025-03-04 07:39:42,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,737 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:42,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 186 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-03-04 07:39:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2025-03-04 07:39:42,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.893939393939394) internal successors, (125), 116 states have internal predecessors, (125), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:42,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2025-03-04 07:39:42,750 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 6 [2025-03-04 07:39:42,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:42,750 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2025-03-04 07:39:42,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:42,750 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2025-03-04 07:39:42,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:39:42,751 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:42,751 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:42,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:39:42,751 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-04 07:39:42,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:42,751 INFO L85 PathProgramCache]: Analyzing trace with hash -951111235, now seen corresponding path program 1 times [2025-03-04 07:39:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-04 07:39:42,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:42,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:42,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:39:42,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:39:42,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:42,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:42,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:42,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:42,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726377688] [2025-03-04 07:39:42,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726377688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:42,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:42,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:42,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166671507] [2025-03-04 07:39:42,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:42,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:42,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:42,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:42,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,835 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:42,911 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2025-03-04 07:39:42,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:42,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:42,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:42,912 INFO L225 Difference]: With dead ends: 115 [2025-03-04 07:39:42,912 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 07:39:42,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:42,913 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:42,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 137 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 07:39:42,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-03-04 07:39:42,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 66 states have (on average 1.8181818181818181) internal successors, (120), 111 states have internal predecessors, (120), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:42,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 124 transitions. [2025-03-04 07:39:42,921 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 124 transitions. Word has length 12 [2025-03-04 07:39:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 124 transitions. [2025-03-04 07:39:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:42,921 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 124 transitions. [2025-03-04 07:39:42,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-04 07:39:42,922 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:42,922 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:42,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:39:42,922 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-04 07:39:42,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:42,923 INFO L85 PathProgramCache]: Analyzing trace with hash -951111234, now seen corresponding path program 1 times [2025-03-04 07:39:42,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:42,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64092446] [2025-03-04 07:39:42,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:42,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:42,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 07:39:42,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 07:39:42,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:42,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:43,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:43,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:43,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64092446] [2025-03-04 07:39:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64092446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:39:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399166456] [2025-03-04 07:39:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:43,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:43,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:43,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:43,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:43,023 INFO L87 Difference]: Start difference. First operand 115 states and 124 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:43,074 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2025-03-04 07:39:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:43,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:43,074 INFO L225 Difference]: With dead ends: 110 [2025-03-04 07:39:43,074 INFO L226 Difference]: Without dead ends: 110 [2025-03-04 07:39:43,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:43,076 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:43,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 146 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:39:43,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2025-03-04 07:39:43,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2025-03-04 07:39:43,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 66 states have (on average 1.7424242424242424) internal successors, (115), 106 states have internal predecessors, (115), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:43,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2025-03-04 07:39:43,083 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 12 [2025-03-04 07:39:43,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:43,083 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2025-03-04 07:39:43,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 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-04 07:39:43,083 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2025-03-04 07:39:43,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:39:43,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:43,084 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:43,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 07:39:43,084 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-04 07:39:43,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:43,084 INFO L85 PathProgramCache]: Analyzing trace with hash 580322881, now seen corresponding path program 1 times [2025-03-04 07:39:43,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:43,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076514981] [2025-03-04 07:39:43,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:43,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:39:43,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:39:43,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:43,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:43,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:43,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076514981] [2025-03-04 07:39:43,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076514981] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:43,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:43,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 07:39:43,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850821825] [2025-03-04 07:39:43,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:43,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:39:43,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:43,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:39:43,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:39:43,285 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:43,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:43,542 INFO L93 Difference]: Finished difference Result 214 states and 235 transitions. [2025-03-04 07:39:43,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:39:43,542 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 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 13 [2025-03-04 07:39:43,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:43,543 INFO L225 Difference]: With dead ends: 214 [2025-03-04 07:39:43,543 INFO L226 Difference]: Without dead ends: 214 [2025-03-04 07:39:43,544 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-04 07:39:43,544 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 157 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:43,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 275 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:39:43,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2025-03-04 07:39:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 143. [2025-03-04 07:39:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6538461538461537) internal successors, (172), 138 states have internal predecessors, (172), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:43,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 176 transitions. [2025-03-04 07:39:43,549 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 176 transitions. Word has length 13 [2025-03-04 07:39:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:43,550 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 176 transitions. [2025-03-04 07:39:43,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:43,550 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 176 transitions. [2025-03-04 07:39:43,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-04 07:39:43,550 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:43,550 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:39:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 07:39:43,551 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-04 07:39:43,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:43,551 INFO L85 PathProgramCache]: Analyzing trace with hash 580322882, now seen corresponding path program 1 times [2025-03-04 07:39:43,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-04 07:39:43,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:43,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 07:39:43,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 07:39:43,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:43,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:43,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:43,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:43,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698821941] [2025-03-04 07:39:43,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698821941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:43,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:43,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 07:39:43,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153447029] [2025-03-04 07:39:43,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:43,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:39:43,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:43,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:39:43,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:39:43,806 INFO L87 Difference]: Start difference. First operand 143 states and 176 transitions. Second operand has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:44,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:44,019 INFO L93 Difference]: Finished difference Result 251 states and 274 transitions. [2025-03-04 07:39:44,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:39:44,019 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 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 13 [2025-03-04 07:39:44,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:44,020 INFO L225 Difference]: With dead ends: 251 [2025-03-04 07:39:44,020 INFO L226 Difference]: Without dead ends: 251 [2025-03-04 07:39:44,020 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:39:44,021 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 432 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:44,021 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 252 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:39:44,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2025-03-04 07:39:44,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 142. [2025-03-04 07:39:44,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 104 states have (on average 1.5576923076923077) internal successors, (162), 137 states have internal predecessors, (162), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-04 07:39:44,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 166 transitions. [2025-03-04 07:39:44,025 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 166 transitions. Word has length 13 [2025-03-04 07:39:44,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:44,025 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 166 transitions. [2025-03-04 07:39:44,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 166 transitions. [2025-03-04 07:39:44,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:39:44,026 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:44,026 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] [2025-03-04 07:39:44,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 07:39:44,026 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:44,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:44,027 INFO L85 PathProgramCache]: Analyzing trace with hash 150480109, now seen corresponding path program 1 times [2025-03-04 07:39:44,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:44,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-04 07:39:44,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:44,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:44,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:39:44,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:39:44,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:44,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:44,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:44,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873290175] [2025-03-04 07:39:44,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873290175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:44,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:44,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 07:39:44,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676164234] [2025-03-04 07:39:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:44,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:39:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:44,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:39:44,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:39:44,351 INFO L87 Difference]: Start difference. First operand 142 states and 166 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:44,467 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2025-03-04 07:39:44,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:39:44,467 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 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 22 [2025-03-04 07:39:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:44,468 INFO L225 Difference]: With dead ends: 163 [2025-03-04 07:39:44,468 INFO L226 Difference]: Without dead ends: 163 [2025-03-04 07:39:44,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 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-04 07:39:44,468 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:44,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 516 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:39:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-03-04 07:39:44,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 149. [2025-03-04 07:39:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 110 states have (on average 1.5272727272727273) internal successors, (168), 143 states have internal predecessors, (168), 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-04 07:39:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 174 transitions. [2025-03-04 07:39:44,472 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 174 transitions. Word has length 22 [2025-03-04 07:39:44,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:44,473 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 174 transitions. [2025-03-04 07:39:44,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 174 transitions. [2025-03-04 07:39:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-04 07:39:44,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:44,473 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] [2025-03-04 07:39:44,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 07:39:44,474 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-04 07:39:44,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:44,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1176828945, now seen corresponding path program 1 times [2025-03-04 07:39:44,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:44,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437665250] [2025-03-04 07:39:44,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:44,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:44,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 07:39:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 07:39:44,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:44,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:44,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437665250] [2025-03-04 07:39:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437665250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:44,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 07:39:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678136079] [2025-03-04 07:39:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:44,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:39:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:44,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:39:44,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:39:44,874 INFO L87 Difference]: Start difference. First operand 149 states and 174 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:45,153 INFO L93 Difference]: Finished difference Result 189 states and 216 transitions. [2025-03-04 07:39:45,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 07:39:45,153 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 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 24 [2025-03-04 07:39:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:45,154 INFO L225 Difference]: With dead ends: 189 [2025-03-04 07:39:45,154 INFO L226 Difference]: Without dead ends: 189 [2025-03-04 07:39:45,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 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-04 07:39:45,155 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 144 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:45,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 548 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 07:39:45,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2025-03-04 07:39:45,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2025-03-04 07:39:45,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 113 states have (on average 1.5132743362831858) internal successors, (171), 146 states have internal predecessors, (171), 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-04 07:39:45,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2025-03-04 07:39:45,161 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 24 [2025-03-04 07:39:45,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:45,161 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2025-03-04 07:39:45,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 10 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:39:45,162 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2025-03-04 07:39:45,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:39:45,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:45,162 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, 1] [2025-03-04 07:39:45,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:39:45,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:45,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:45,163 INFO L85 PathProgramCache]: Analyzing trace with hash -194966963, now seen corresponding path program 1 times [2025-03-04 07:39:45,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:45,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-04 07:39:45,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:45,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:45,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:39:45,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:39:45,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:45,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:45,485 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-04 07:39:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711486291] [2025-03-04 07:39:45,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711486291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:45,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655446722] [2025-03-04 07:39:45,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:45,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:45,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:45,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:45,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:39:45,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:39:45,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:39:45,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:45,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:45,589 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-04 07:39:45,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:45,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:45,663 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base 1))) is different from true [2025-03-04 07:39:45,714 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:39:45,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:39:45,742 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-04 07:39:45,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-04 07:39:45,757 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-04 07:39:45,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:45,956 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-04 07:39:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655446722] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:45,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5] total 10 [2025-03-04 07:39:45,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213765866] [2025-03-04 07:39:45,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:45,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:39:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:45,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:39:45,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=68, Unknown=1, NotChecked=16, Total=110 [2025-03-04 07:39:45,958 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:39:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:46,346 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2025-03-04 07:39:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 07:39:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 32 [2025-03-04 07:39:46,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:46,348 INFO L225 Difference]: With dead ends: 190 [2025-03-04 07:39:46,348 INFO L226 Difference]: Without dead ends: 190 [2025-03-04 07:39:46,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=304, Unknown=1, NotChecked=38, Total=462 [2025-03-04 07:39:46,348 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 129 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:46,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 347 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 417 Invalid, 0 Unknown, 152 Unchecked, 0.2s Time] [2025-03-04 07:39:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-03-04 07:39:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 160. [2025-03-04 07:39:46,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 121 states have (on average 1.487603305785124) internal successors, (180), 154 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-04 07:39:46,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 187 transitions. [2025-03-04 07:39:46,352 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 187 transitions. Word has length 32 [2025-03-04 07:39:46,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:46,352 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 187 transitions. [2025-03-04 07:39:46,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.7) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 07:39:46,352 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 187 transitions. [2025-03-04 07:39:46,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-04 07:39:46,353 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:46,353 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, 1] [2025-03-04 07:39:46,360 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 07:39:46,553 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,SelfDestructingSolverStorable10 [2025-03-04 07:39:46,553 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:46,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:46,554 INFO L85 PathProgramCache]: Analyzing trace with hash -194966962, now seen corresponding path program 1 times [2025-03-04 07:39:46,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:46,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-03-04 07:39:46,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:46,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:46,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:39:46,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:39:46,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:46,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:46,849 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-04 07:39:46,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230831997] [2025-03-04 07:39:46,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230831997] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:46,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856203623] [2025-03-04 07:39:46,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:46,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:46,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:46,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:46,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:39:46,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 07:39:46,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 07:39:46,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:46,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:46,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:39:46,947 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:46,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:39:46,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:47,007 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-04 07:39:47,109 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:39:47,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:39:47,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:39:47,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:39:47,238 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-04 07:39:47,250 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:39:47,251 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-04 07:39:47,269 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-04 07:39:47,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856203623] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:47,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:39:47,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2025-03-04 07:39:47,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479920476] [2025-03-04 07:39:47,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:47,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-04 07:39:47,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:47,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-04 07:39:47,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=226, Unknown=1, NotChecked=30, Total=306 [2025-03-04 07:39:47,536 INFO L87 Difference]: Start difference. First operand 160 states and 187 transitions. Second operand has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 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-04 07:39:52,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:52,462 INFO L93 Difference]: Finished difference Result 339 states and 402 transitions. [2025-03-04 07:39:52,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:39:52,462 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 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 32 [2025-03-04 07:39:52,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:52,464 INFO L225 Difference]: With dead ends: 339 [2025-03-04 07:39:52,464 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 07:39:52,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=162, Invalid=709, Unknown=3, NotChecked=56, Total=930 [2025-03-04 07:39:52,465 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 385 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:52,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 501 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 638 Invalid, 0 Unknown, 257 Unchecked, 0.5s Time] [2025-03-04 07:39:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 07:39:52,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 250. [2025-03-04 07:39:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 207 states have (on average 1.4782608695652173) internal successors, (306), 239 states have internal predecessors, (306), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:39:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 320 transitions. [2025-03-04 07:39:52,475 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 320 transitions. Word has length 32 [2025-03-04 07:39:52,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:52,475 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 320 transitions. [2025-03-04 07:39:52,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.153846153846154) internal successors, (54), 11 states have internal predecessors, (54), 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-04 07:39:52,475 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 320 transitions. [2025-03-04 07:39:52,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-04 07:39:52,477 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:52,477 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, 1] [2025-03-04 07:39:52,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:39:52,681 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,SelfDestructingSolverStorable11 [2025-03-04 07:39:52,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:52,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:52,682 INFO L85 PathProgramCache]: Analyzing trace with hash 963492448, now seen corresponding path program 1 times [2025-03-04 07:39:52,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:52,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-04 07:39:52,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:52,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:52,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 07:39:52,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 07:39:52,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:52,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:52,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:52,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:52,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296084512] [2025-03-04 07:39:52,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296084512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:39:52,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:39:52,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:39:52,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40543158] [2025-03-04 07:39:52,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:39:52,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:39:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:52,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:39:52,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:52,755 INFO L87 Difference]: Start difference. First operand 250 states and 320 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:39:52,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:52,772 INFO L93 Difference]: Finished difference Result 238 states and 292 transitions. [2025-03-04 07:39:52,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:39:52,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 31 [2025-03-04 07:39:52,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:52,774 INFO L225 Difference]: With dead ends: 238 [2025-03-04 07:39:52,774 INFO L226 Difference]: Without dead ends: 238 [2025-03-04 07:39:52,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:39:52,775 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 11 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 195 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-04 07:39:52,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 195 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:39:52,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2025-03-04 07:39:52,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 219. [2025-03-04 07:39:52,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 176 states have (on average 1.4318181818181819) internal successors, (252), 208 states have internal predecessors, (252), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:39:52,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 266 transitions. [2025-03-04 07:39:52,782 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 266 transitions. Word has length 31 [2025-03-04 07:39:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:52,783 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 266 transitions. [2025-03-04 07:39:52,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-04 07:39:52,783 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 266 transitions. [2025-03-04 07:39:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:39:52,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:52,785 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, 1] [2025-03-04 07:39:52,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 07:39:52,785 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:52,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1803755846, now seen corresponding path program 1 times [2025-03-04 07:39:52,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:52,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-03-04 07:39:52,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:52,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:52,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:39:52,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:39:52,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:52,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:53,264 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-04 07:39:53,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467423903] [2025-03-04 07:39:53,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467423903] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:53,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321989134] [2025-03-04 07:39:53,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:53,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:53,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:53,267 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:53,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:39:53,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:39:53,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:39:53,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:53,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:53,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-04 07:39:53,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:53,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:53,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:39:53,501 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-04 07:39:53,602 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-04 07:39:53,602 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-04 07:39:53,675 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:39:53,675 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 34 treesize of output 12 [2025-03-04 07:39:53,677 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-04 07:39:53,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:53,975 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-04 07:39:54,852 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-04 07:39:54,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1321989134] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:39:54,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:39:54,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2025-03-04 07:39:54,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418984429] [2025-03-04 07:39:54,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:39:54,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-04 07:39:54,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:39:54,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-04 07:39:54,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2025-03-04 07:39:54,854 INFO L87 Difference]: Start difference. First operand 219 states and 266 transitions. Second operand has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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-04 07:39:56,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:39:56,026 INFO L93 Difference]: Finished difference Result 266 states and 328 transitions. [2025-03-04 07:39:56,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-04 07:39:56,027 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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 40 [2025-03-04 07:39:56,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:39:56,028 INFO L225 Difference]: With dead ends: 266 [2025-03-04 07:39:56,028 INFO L226 Difference]: Without dead ends: 266 [2025-03-04 07:39:56,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2025-03-04 07:39:56,029 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 301 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:39:56,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 739 Invalid, 809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-04 07:39:56,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-04 07:39:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 225. [2025-03-04 07:39:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 181 states have (on average 1.4143646408839778) internal successors, (256), 214 states have internal predecessors, (256), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:39:56,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 270 transitions. [2025-03-04 07:39:56,040 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 270 transitions. Word has length 40 [2025-03-04 07:39:56,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:39:56,040 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 270 transitions. [2025-03-04 07:39:56,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.714285714285714) internal successors, (99), 21 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-04 07:39:56,040 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 270 transitions. [2025-03-04 07:39:56,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-03-04 07:39:56,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:39:56,041 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, 1] [2025-03-04 07:39:56,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 07:39:56,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:56,242 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:39:56,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:39:56,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1803755847, now seen corresponding path program 1 times [2025-03-04 07:39:56,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:39:56,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568793416] [2025-03-04 07:39:56,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:56,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:39:56,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:39:56,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:39:56,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:56,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:39:57,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:39:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568793416] [2025-03-04 07:39:57,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568793416] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:39:57,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561815784] [2025-03-04 07:39:57,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:39:57,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:39:57,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:39:57,572 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:39:57,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:39:57,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 07:39:57,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 07:39:57,678 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:39:57,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:39:57,680 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:39:57,685 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:39:57,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:39:57,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:39:57,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:39:57,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:39:57,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:39:58,051 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:39:58,052 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-04 07:39:58,057 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-04 07:39:58,140 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-04 07:39:58,182 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-04 07:39:58,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:39:58,627 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-04 07:39:58,655 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-04 07:39:58,744 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-04 07:39:58,963 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-04 07:39:59,120 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-04 07:39:59,258 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-04 07:39:59,423 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-04 07:39:59,626 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-04 07:39:59,792 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-04 07:39:59,926 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-04 07:40:00,046 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-04 07:40:00,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561815784] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:00,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:00,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 7, 6] total 33 [2025-03-04 07:40:00,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804558966] [2025-03-04 07:40:00,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:00,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 07:40:00,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:00,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 07:40:00,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1015, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 07:40:00,047 INFO L87 Difference]: Start difference. First operand 225 states and 270 transitions. Second operand has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 32 states have internal predecessors, (101), 5 states have call successors, (5), 5 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-04 07:40:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:03,330 INFO L93 Difference]: Finished difference Result 481 states and 616 transitions. [2025-03-04 07:40:03,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-04 07:40:03,330 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 32 states have internal predecessors, (101), 5 states have call successors, (5), 5 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 40 [2025-03-04 07:40:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:03,332 INFO L225 Difference]: With dead ends: 481 [2025-03-04 07:40:03,332 INFO L226 Difference]: Without dead ends: 481 [2025-03-04 07:40:03,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 66 SyntacticMatches, 8 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=663, Invalid=3627, Unknown=0, NotChecked=0, Total=4290 [2025-03-04 07:40:03,336 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 524 mSDsluCounter, 1394 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:03,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 1480 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-04 07:40:03,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2025-03-04 07:40:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 225. [2025-03-04 07:40:03,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 181 states have (on average 1.408839779005525) internal successors, (255), 214 states have internal predecessors, (255), 6 states have call successors, (6), 5 states have call predecessors, (6), 5 states have return successors, (8), 5 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-04 07:40:03,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2025-03-04 07:40:03,353 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 40 [2025-03-04 07:40:03,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:03,353 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2025-03-04 07:40:03,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.0606060606060606) internal successors, (101), 32 states have internal predecessors, (101), 5 states have call successors, (5), 5 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-04 07:40:03,353 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2025-03-04 07:40:03,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-04 07:40:03,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:03,354 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, 1] [2025-03-04 07:40:03,361 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:40:03,554 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,SelfDestructingSolverStorable14 [2025-03-04 07:40:03,554 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-04 07:40:03,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:03,555 INFO L85 PathProgramCache]: Analyzing trace with hash 866381409, now seen corresponding path program 1 times [2025-03-04 07:40:03,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:03,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903792960] [2025-03-04 07:40:03,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:03,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:03,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:40:03,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:40:03,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:03,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:04,060 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-04 07:40:04,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903792960] [2025-03-04 07:40:04,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903792960] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:04,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325488260] [2025-03-04 07:40:04,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:04,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:04,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:04,062 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:04,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:40:04,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-04 07:40:04,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-04 07:40:04,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:04,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:04,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-03-04 07:40:04,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:04,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:04,196 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:40:04,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:40:04,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:40:04,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:40:04,217 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-04 07:40:04,225 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-04 07:40:04,616 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-04 07:40:04,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:04,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325488260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:04,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:04,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 18 [2025-03-04 07:40:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165785397] [2025-03-04 07:40:04,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:04,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:40:04,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:04,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:40:04,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=278, Unknown=12, NotChecked=0, Total=342 [2025-03-04 07:40:04,748 INFO L87 Difference]: Start difference. First operand 225 states and 269 transitions. Second operand has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 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-04 07:40:05,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:05,383 INFO L93 Difference]: Finished difference Result 310 states and 370 transitions. [2025-03-04 07:40:05,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:40:05,383 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 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 41 [2025-03-04 07:40:05,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:05,385 INFO L225 Difference]: With dead ends: 310 [2025-03-04 07:40:05,385 INFO L226 Difference]: Without dead ends: 310 [2025-03-04 07:40:05,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=520, Unknown=12, NotChecked=0, Total=650 [2025-03-04 07:40:05,386 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 245 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:05,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 578 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:40:05,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2025-03-04 07:40:05,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 237. [2025-03-04 07:40:05,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 191 states have (on average 1.387434554973822) internal successors, (265), 224 states have internal predecessors, (265), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (10), 5 states have call predecessors, (10), 8 states have call successors, (10) [2025-03-04 07:40:05,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 283 transitions. [2025-03-04 07:40:05,395 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 283 transitions. Word has length 41 [2025-03-04 07:40:05,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:05,395 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 283 transitions. [2025-03-04 07:40:05,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7777777777777777) internal successors, (50), 15 states have internal predecessors, (50), 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-04 07:40:05,396 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 283 transitions. [2025-03-04 07:40:05,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 07:40:05,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:05,397 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, 1] [2025-03-04 07:40:05,405 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 07:40:05,598 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,SelfDestructingSolverStorable15 [2025-03-04 07:40:05,599 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:05,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:05,599 INFO L85 PathProgramCache]: Analyzing trace with hash -390447005, now seen corresponding path program 1 times [2025-03-04 07:40:05,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:05,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-03-04 07:40:05,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:05,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:05,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:40:05,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:40:05,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:05,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:06,528 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-04 07:40:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175278297] [2025-03-04 07:40:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175278297] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688500646] [2025-03-04 07:40:06,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:06,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:06,531 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:06,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:40:06,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 07:40:06,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 07:40:06,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:06,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:06,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-03-04 07:40:06,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:06,688 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:40:06,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:40:06,716 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-04 07:40:06,721 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-04 07:40:06,889 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-04 07:40:06,893 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-04 07:40:07,119 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-04 07:40:07,119 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688500646] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:08,289 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:08,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 14] total 32 [2025-03-04 07:40:08,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034295897] [2025-03-04 07:40:08,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:08,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-04 07:40:08,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:08,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-04 07:40:08,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=907, Unknown=10, NotChecked=0, Total=1056 [2025-03-04 07:40:08,290 INFO L87 Difference]: Start difference. First operand 237 states and 283 transitions. Second operand has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 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-04 07:40:09,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:09,359 INFO L93 Difference]: Finished difference Result 323 states and 385 transitions. [2025-03-04 07:40:09,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 07:40:09,359 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 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 43 [2025-03-04 07:40:09,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:09,360 INFO L225 Difference]: With dead ends: 323 [2025-03-04 07:40:09,360 INFO L226 Difference]: Without dead ends: 323 [2025-03-04 07:40:09,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=379, Invalid=1867, Unknown=10, NotChecked=0, Total=2256 [2025-03-04 07:40:09,361 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 279 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 1175 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:09,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 647 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1175 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:40:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2025-03-04 07:40:09,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 237. [2025-03-04 07:40:09,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 190 states have (on average 1.3526315789473684) internal successors, (257), 224 states have internal predecessors, (257), 8 states have call successors, (8), 7 states have call predecessors, (8), 7 states have return successors, (12), 5 states have call predecessors, (12), 8 states have call successors, (12) [2025-03-04 07:40:09,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 277 transitions. [2025-03-04 07:40:09,366 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 277 transitions. Word has length 43 [2025-03-04 07:40:09,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:09,366 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 277 transitions. [2025-03-04 07:40:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.28125) internal successors, (73), 29 states have internal predecessors, (73), 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-04 07:40:09,366 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 277 transitions. [2025-03-04 07:40:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:40:09,366 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:09,366 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, 1] [2025-03-04 07:40:09,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:09,567 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,SelfDestructingSolverStorable16 [2025-03-04 07:40:09,567 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:09,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1003851028, now seen corresponding path program 1 times [2025-03-04 07:40:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-04 07:40:09,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:09,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:40:09,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:40:09,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:09,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:09,630 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-04 07:40:09,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905107225] [2025-03-04 07:40:09,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905107225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:09,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654155000] [2025-03-04 07:40:09,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:09,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:09,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:09,632 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:09,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:40:09,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 07:40:09,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 07:40:09,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:09,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:09,759 INFO L256 TraceCheckSpWp]: Trace formula consists of 406 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 07:40:09,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:09,779 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-04 07:40:09,779 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:09,806 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-04 07:40:09,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654155000] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:09,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:09,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 07:40:09,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322872356] [2025-03-04 07:40:09,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:09,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:40:09,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:09,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:40:09,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:40:09,808 INFO L87 Difference]: Start difference. First operand 237 states and 277 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-04 07:40:09,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:09,851 INFO L93 Difference]: Finished difference Result 275 states and 323 transitions. [2025-03-04 07:40:09,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:40:09,851 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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 46 [2025-03-04 07:40:09,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:09,852 INFO L225 Difference]: With dead ends: 275 [2025-03-04 07:40:09,852 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 07:40:09,852 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:40:09,853 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 53 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:09,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 377 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:09,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 07:40:09,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 265. [2025-03-04 07:40:09,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 214 states have (on average 1.3598130841121496) internal successors, (291), 246 states have internal predecessors, (291), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (20), 11 states have call predecessors, (20), 12 states have call successors, (20) [2025-03-04 07:40:09,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 323 transitions. [2025-03-04 07:40:09,861 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 323 transitions. Word has length 46 [2025-03-04 07:40:09,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:09,862 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 323 transitions. [2025-03-04 07:40:09,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 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-04 07:40:09,862 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 323 transitions. [2025-03-04 07:40:09,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:40:09,863 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:09,863 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, 1] [2025-03-04 07:40:09,870 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-04 07:40:10,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:10,063 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-04 07:40:10,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:10,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1196703562, now seen corresponding path program 1 times [2025-03-04 07:40:10,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:10,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086382639] [2025-03-04 07:40:10,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:10,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:10,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:40:10,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:40:10,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:10,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:10,499 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-04 07:40:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086382639] [2025-03-04 07:40:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086382639] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:10,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025221658] [2025-03-04 07:40:10,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:10,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:10,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:10,501 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:10,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:40:10,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:40:10,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:40:10,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:10,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:10,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-04 07:40:10,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:10,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-04 07:40:10,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-04 07:40:10,773 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-04 07:40:10,773 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-04 07:40:10,806 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-04 07:40:10,808 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-04 07:40:10,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:10,971 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-04 07:40:11,355 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-04 07:40:11,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025221658] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:11,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:11,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2025-03-04 07:40:11,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375066888] [2025-03-04 07:40:11,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:11,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:40:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:11,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:40:11,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:40:11,356 INFO L87 Difference]: Start difference. First operand 265 states and 323 transitions. Second operand has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-04 07:40:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:11,989 INFO L93 Difference]: Finished difference Result 311 states and 369 transitions. [2025-03-04 07:40:11,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 07:40:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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 58 [2025-03-04 07:40:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:11,991 INFO L225 Difference]: With dead ends: 311 [2025-03-04 07:40:11,991 INFO L226 Difference]: Without dead ends: 311 [2025-03-04 07:40:11,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:40:11,992 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 182 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 971 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 971 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:11,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 764 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 971 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-04 07:40:11,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2025-03-04 07:40:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2025-03-04 07:40:11,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 262 states, 212 states have (on average 1.3443396226415094) internal successors, (285), 243 states have internal predecessors, (285), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 07:40:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 311 transitions. [2025-03-04 07:40:11,997 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 311 transitions. Word has length 58 [2025-03-04 07:40:11,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:11,997 INFO L471 AbstractCegarLoop]: Abstraction has 262 states and 311 transitions. [2025-03-04 07:40:11,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.631578947368421) internal successors, (107), 19 states have internal predecessors, (107), 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-04 07:40:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 311 transitions. [2025-03-04 07:40:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-03-04 07:40:11,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:11,998 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, 1] [2025-03-04 07:40:12,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 07:40:12,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:12,199 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:12,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:12,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1196703563, now seen corresponding path program 1 times [2025-03-04 07:40:12,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:12,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-03-04 07:40:12,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:12,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:12,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:40:12,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:40:12,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:12,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:13,863 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 07:40:13,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409579384] [2025-03-04 07:40:13,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409579384] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:13,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904687707] [2025-03-04 07:40:13,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:13,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:13,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:13,865 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:13,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:40:13,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-04 07:40:14,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-04 07:40:14,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:14,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:14,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 49 conjuncts are in the unsatisfiable core [2025-03-04 07:40:14,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:14,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:40:14,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:14,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:40:14,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-04 07:40:14,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:40:14,321 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-03-04 07:40:14,321 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-04 07:40:14,324 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-04 07:40:14,421 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-04 07:40:14,457 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-04 07:40:14,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:14,867 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-04 07:40:14,909 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-04 07:40:15,003 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-04 07:40:15,223 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-04 07:40:15,391 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-04 07:40:15,578 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-04 07:40:15,753 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-04 07:40:15,895 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-04 07:40:16,078 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-04 07:40:16,252 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-04 07:40:16,467 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-04 07:40:16,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904687707] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:16,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:16,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 6] total 41 [2025-03-04 07:40:16,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491873137] [2025-03-04 07:40:16,468 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:16,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-04 07:40:16,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:16,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-04 07:40:16,469 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1567, Unknown=0, NotChecked=0, Total=1722 [2025-03-04 07:40:16,469 INFO L87 Difference]: Start difference. First operand 262 states and 311 transitions. Second operand has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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-04 07:40:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:19,953 INFO L93 Difference]: Finished difference Result 453 states and 542 transitions. [2025-03-04 07:40:19,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 07:40:19,954 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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 58 [2025-03-04 07:40:19,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:19,956 INFO L225 Difference]: With dead ends: 453 [2025-03-04 07:40:19,956 INFO L226 Difference]: Without dead ends: 453 [2025-03-04 07:40:19,957 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 114 SyntacticMatches, 8 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1936 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=928, Invalid=5714, Unknown=0, NotChecked=0, Total=6642 [2025-03-04 07:40:19,958 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 657 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 2259 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:19,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [659 Valid, 1064 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2259 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 07:40:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2025-03-04 07:40:19,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 261. [2025-03-04 07:40:19,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 212 states have (on average 1.3349056603773586) internal successors, (283), 242 states have internal predecessors, (283), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 07:40:19,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 309 transitions. [2025-03-04 07:40:19,971 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 309 transitions. Word has length 58 [2025-03-04 07:40:19,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:19,971 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 309 transitions. [2025-03-04 07:40:19,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.2195121951219514) internal successors, (132), 41 states have internal predecessors, (132), 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-04 07:40:19,971 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 309 transitions. [2025-03-04 07:40:19,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-03-04 07:40:19,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:19,972 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:19,979 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:40:20,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:20,173 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-04 07:40:20,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:20,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1084827900, now seen corresponding path program 1 times [2025-03-04 07:40:20,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:20,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218504498] [2025-03-04 07:40:20,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:20,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:20,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 07:40:20,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:40:20,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:20,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:20,217 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-04 07:40:20,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218504498] [2025-03-04 07:40:20,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218504498] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:20,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160882932] [2025-03-04 07:40:20,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:20,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:20,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:20,220 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:20,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:40:20,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-04 07:40:20,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-04 07:40:20,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:20,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:20,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 593 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 07:40:20,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-04 07:40:20,414 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 07:40:20,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160882932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:40:20,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 07:40:20,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 3 [2025-03-04 07:40:20,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627024044] [2025-03-04 07:40:20,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:40:20,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:40:20,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:20,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:40:20,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:20,415 INFO L87 Difference]: Start difference. First operand 261 states and 309 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:40:20,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:20,422 INFO L93 Difference]: Finished difference Result 259 states and 306 transitions. [2025-03-04 07:40:20,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:40:20,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 64 [2025-03-04 07:40:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:20,424 INFO L225 Difference]: With dead ends: 259 [2025-03-04 07:40:20,425 INFO L226 Difference]: Without dead ends: 259 [2025-03-04 07:40:20,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:40:20,426 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:20,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 195 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:40:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2025-03-04 07:40:20,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2025-03-04 07:40:20,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 210 states have (on average 1.3333333333333333) internal successors, (280), 240 states have internal predecessors, (280), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 07:40:20,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 306 transitions. [2025-03-04 07:40:20,430 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 306 transitions. Word has length 64 [2025-03-04 07:40:20,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:20,430 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 306 transitions. [2025-03-04 07:40:20,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 07:40:20,430 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 306 transitions. [2025-03-04 07:40:20,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2025-03-04 07:40:20,433 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:20,433 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:20,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 07:40:20,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:40:20,634 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:20,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:20,634 INFO L85 PathProgramCache]: Analyzing trace with hash 893739379, now seen corresponding path program 1 times [2025-03-04 07:40:20,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:20,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884917516] [2025-03-04 07:40:20,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:20,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:20,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:40:20,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:40:20,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:20,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:40:20,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884917516] [2025-03-04 07:40:20,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884917516] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:20,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051559174] [2025-03-04 07:40:20,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:20,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:20,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:20,944 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:20,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:40:21,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-04 07:40:21,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-04 07:40:21,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:21,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:21,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:40:21,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:21,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:40:21,322 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 16 treesize of output 11 [2025-03-04 07:40:21,331 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:40:21,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:40:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:40:21,350 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:21,519 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 49 treesize of output 45 [2025-03-04 07:40:21,543 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2025-03-04 07:40:21,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2025-03-04 07:40:21,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:40:21,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2025-03-04 07:40:21,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:40:21,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 36 treesize of output 76 [2025-03-04 07:40:21,952 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-04 07:40:21,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051559174] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:21,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:21,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 22 [2025-03-04 07:40:21,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248676605] [2025-03-04 07:40:21,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:21,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:40:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:21,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:40:21,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=433, Unknown=0, NotChecked=0, Total=506 [2025-03-04 07:40:21,953 INFO L87 Difference]: Start difference. First operand 259 states and 306 transitions. Second operand has 23 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:40:22,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:22,534 INFO L93 Difference]: Finished difference Result 275 states and 317 transitions. [2025-03-04 07:40:22,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 07:40:22,535 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 69 [2025-03-04 07:40:22,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:22,536 INFO L225 Difference]: With dead ends: 275 [2025-03-04 07:40:22,536 INFO L226 Difference]: Without dead ends: 275 [2025-03-04 07:40:22,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:40:22,537 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 385 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:22,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 570 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:40:22,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2025-03-04 07:40:22,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 249. [2025-03-04 07:40:22,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 205 states have (on average 1.2926829268292683) internal successors, (265), 230 states have internal predecessors, (265), 12 states have call successors, (12), 7 states have call predecessors, (12), 7 states have return successors, (14), 11 states have call predecessors, (14), 12 states have call successors, (14) [2025-03-04 07:40:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 291 transitions. [2025-03-04 07:40:22,544 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 291 transitions. Word has length 69 [2025-03-04 07:40:22,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:22,544 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 291 transitions. [2025-03-04 07:40:22,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.590909090909091) internal successors, (101), 20 states have internal predecessors, (101), 5 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-04 07:40:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 291 transitions. [2025-03-04 07:40:22,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-04 07:40:22,551 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:22,552 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:40:22,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:40:22,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-03-04 07:40:22,752 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:22,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:22,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1815515399, now seen corresponding path program 1 times [2025-03-04 07:40:22,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:22,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453123836] [2025-03-04 07:40:22,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:22,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:22,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 07:40:22,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 07:40:22,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:22,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:23,443 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 19 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:40:23,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453123836] [2025-03-04 07:40:23,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453123836] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:23,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311795132] [2025-03-04 07:40:23,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:23,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:23,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:23,445 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:23,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:40:23,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 07:40:23,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 07:40:23,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:23,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:23,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 620 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-04 07:40:23,629 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:23,733 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-04 07:40:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:40:23,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:24,029 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 32 treesize of output 26 [2025-03-04 07:40:24,112 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:40:24,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311795132] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:24,112 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:24,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 10] total 29 [2025-03-04 07:40:24,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403480780] [2025-03-04 07:40:24,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:24,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-04 07:40:24,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:24,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-04 07:40:24,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2025-03-04 07:40:24,114 INFO L87 Difference]: Start difference. First operand 249 states and 291 transitions. Second operand has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:40:25,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:25,243 INFO L93 Difference]: Finished difference Result 264 states and 311 transitions. [2025-03-04 07:40:25,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-04 07:40:25,244 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 70 [2025-03-04 07:40:25,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:25,245 INFO L225 Difference]: With dead ends: 264 [2025-03-04 07:40:25,245 INFO L226 Difference]: Without dead ends: 264 [2025-03-04 07:40:25,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=578, Invalid=2844, Unknown=0, NotChecked=0, Total=3422 [2025-03-04 07:40:25,246 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 206 mSDsluCounter, 1326 mSDsCounter, 0 mSdLazyCounter, 707 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 732 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 707 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:25,246 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 1401 Invalid, 732 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 707 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 07:40:25,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-03-04 07:40:25,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 240. [2025-03-04 07:40:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 197 states have (on average 1.2944162436548223) internal successors, (255), 221 states have internal predecessors, (255), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2025-03-04 07:40:25,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 279 transitions. [2025-03-04 07:40:25,251 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 279 transitions. Word has length 70 [2025-03-04 07:40:25,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:25,251 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 279 transitions. [2025-03-04 07:40:25,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.9310344827586206) internal successors, (114), 26 states have internal predecessors, (114), 5 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:40:25,251 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 279 transitions. [2025-03-04 07:40:25,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 07:40:25,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:25,252 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2025-03-04 07:40:25,260 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-04 07:40:25,452 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,SelfDestructingSolverStorable22 [2025-03-04 07:40:25,452 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:25,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:25,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1115755890, now seen corresponding path program 2 times [2025-03-04 07:40:25,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:25,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-03-04 07:40:25,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:25,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:25,469 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 07:40:25,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:40:25,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:25,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:26,119 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 07:40:26,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223291006] [2025-03-04 07:40:26,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223291006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:26,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467266320] [2025-03-04 07:40:26,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:26,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:26,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:26,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:26,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:40:26,273 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 72 statements into 2 equivalence classes. [2025-03-04 07:40:26,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 07:40:26,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:26,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:26,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-04 07:40:26,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:26,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:26,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:40:26,405 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-04 07:40:26,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:40:26,517 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2025-03-04 07:40:26,547 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 07:40:26,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-04 07:40:26,627 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-04 07:40:26,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:40:26,676 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-04 07:40:26,691 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-03-04 07:40:26,691 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-04 07:40:26,779 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-04 07:40:26,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-04 07:40:26,906 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-03-04 07:40:26,906 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-04 07:40:26,999 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 33 not checked. [2025-03-04 07:40:26,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:27,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467266320] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:27,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:27,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2025-03-04 07:40:27,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687138046] [2025-03-04 07:40:27,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 07:40:27,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:27,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 07:40:27,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=477, Unknown=2, NotChecked=90, Total=650 [2025-03-04 07:40:27,271 INFO L87 Difference]: Start difference. First operand 240 states and 279 transitions. Second operand has 23 states, 22 states have (on average 5.5) internal successors, (121), 19 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:40:31,332 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-04 07:40:32,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:32,159 INFO L93 Difference]: Finished difference Result 277 states and 320 transitions. [2025-03-04 07:40:32,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 07:40:32,159 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 5.5) internal successors, (121), 19 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 72 [2025-03-04 07:40:32,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:32,160 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:40:32,160 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:40:32,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=993, Unknown=2, NotChecked=134, Total=1332 [2025-03-04 07:40:32,161 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 317 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 268 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:32,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 436 Invalid, 796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 505 Invalid, 1 Unknown, 268 Unchecked, 4.4s Time] [2025-03-04 07:40:32,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:40:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 159. [2025-03-04 07:40:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 127 states have (on average 1.2992125984251968) 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-04 07:40:32,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2025-03-04 07:40:32,165 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 72 [2025-03-04 07:40:32,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:32,165 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2025-03-04 07:40:32,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 5.5) internal successors, (121), 19 states have internal predecessors, (121), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-04 07:40:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2025-03-04 07:40:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-04 07:40:32,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:32,166 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, 1] [2025-03-04 07:40:32,173 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-04 07:40:32,366 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,SelfDestructingSolverStorable23 [2025-03-04 07:40:32,367 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-04 07:40:32,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1839988029, now seen corresponding path program 2 times [2025-03-04 07:40:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:32,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-03-04 07:40:32,367 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:32,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:32,386 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-04 07:40:32,395 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 07:40:32,395 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:32,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:32,484 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-04 07:40:32,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496924754] [2025-03-04 07:40:32,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496924754] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:32,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1449622044] [2025-03-04 07:40:32,484 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:40:32,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:32,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:32,486 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:32,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 07:40:32,661 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 97 statements into 2 equivalence classes. [2025-03-04 07:40:32,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 07:40:32,984 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:40:32,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:32,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 07:40:32,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:33,014 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-04 07:40:33,014 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:33,079 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-04 07:40:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1449622044] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:33,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-04 07:40:33,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170623957] [2025-03-04 07:40:33,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:33,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 07:40:33,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:33,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 07:40:33,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:40:33,080 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-04 07:40:33,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:33,136 INFO L93 Difference]: Finished difference Result 197 states and 207 transitions. [2025-03-04 07:40:33,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:40:33,137 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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 97 [2025-03-04 07:40:33,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:33,138 INFO L225 Difference]: With dead ends: 197 [2025-03-04 07:40:33,138 INFO L226 Difference]: Without dead ends: 197 [2025-03-04 07:40:33,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 188 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-03-04 07:40:33,138 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 82 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:33,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 355 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:40:33,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-03-04 07:40:33,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 177. [2025-03-04 07:40:33,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 143 states have (on average 1.3356643356643356) internal successors, (191), 165 states have internal predecessors, (191), 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-04 07:40:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 207 transitions. [2025-03-04 07:40:33,141 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 207 transitions. Word has length 97 [2025-03-04 07:40:33,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:33,141 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 207 transitions. [2025-03-04 07:40:33,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 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-04 07:40:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2025-03-04 07:40:33,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-04 07:40:33,142 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:33,142 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, 1] [2025-03-04 07:40:33,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 07:40:33,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:33,342 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-04 07:40:33,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:33,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1032647139, now seen corresponding path program 3 times [2025-03-04 07:40:33,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:33,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167517805] [2025-03-04 07:40:33,343 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:40:33,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:33,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 7 equivalence classes. [2025-03-04 07:40:33,374 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 131 statements. [2025-03-04 07:40:33,374 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:40:33,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:33,660 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-04 07:40:33,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167517805] [2025-03-04 07:40:33,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167517805] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:33,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364349708] [2025-03-04 07:40:33,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:40:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:33,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:33,665 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:33,666 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 07:40:33,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 131 statements into 7 equivalence classes. [2025-03-04 07:40:34,698 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 61 of 131 statements. [2025-03-04 07:40:34,699 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-04 07:40:34,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:34,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:40:34,704 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:34,790 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-04 07:40:34,899 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-04 07:40:34,899 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:35,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 32 treesize of output 26 [2025-03-04 07:40:35,136 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-04 07:40:35,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1364349708] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:40:35,136 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:40:35,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 10] total 24 [2025-03-04 07:40:35,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010115276] [2025-03-04 07:40:35,136 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:35,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-04 07:40:35,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:35,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-04 07:40:35,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=479, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:40:35,138 INFO L87 Difference]: Start difference. First operand 177 states and 207 transitions. Second operand has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 07:40:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:35,816 INFO L93 Difference]: Finished difference Result 170 states and 198 transitions. [2025-03-04 07:40:35,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-04 07:40:35,817 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 131 [2025-03-04 07:40:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:35,818 INFO L225 Difference]: With dead ends: 170 [2025-03-04 07:40:35,818 INFO L226 Difference]: Without dead ends: 170 [2025-03-04 07:40:35,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=272, Invalid=1368, Unknown=0, NotChecked=0, Total=1640 [2025-03-04 07:40:35,818 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 143 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 650 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:35,818 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 932 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 650 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 07:40:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-03-04 07:40:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-03-04 07:40:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 136 states have (on average 1.338235294117647) internal successors, (182), 158 states have internal predecessors, (182), 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-04 07:40:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2025-03-04 07:40:35,821 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 131 [2025-03-04 07:40:35,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:35,821 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2025-03-04 07:40:35,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 22 states have internal predecessors, (95), 5 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2025-03-04 07:40:35,821 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2025-03-04 07:40:35,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 07:40:35,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:35,822 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] [2025-03-04 07:40:35,837 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-03-04 07:40:36,023 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,SelfDestructingSolverStorable25 [2025-03-04 07:40:36,023 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:36,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:36,023 INFO L85 PathProgramCache]: Analyzing trace with hash -477985910, now seen corresponding path program 1 times [2025-03-04 07:40:36,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:36,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046688500] [2025-03-04 07:40:36,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:36,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:36,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:40:36,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:40:36,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:36,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:37,119 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 28 proven. 124 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2025-03-04 07:40:37,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046688500] [2025-03-04 07:40:37,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046688500] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:37,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95427412] [2025-03-04 07:40:37,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:37,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:37,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:37,122 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:37,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 07:40:37,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:40:37,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:40:37,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:37,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:37,470 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 113 conjuncts are in the unsatisfiable core [2025-03-04 07:40:37,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:37,593 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-04 07:40:37,634 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-04 07:40:37,635 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-04 07:40:37,862 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-04 07:40:37,878 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 22 treesize of output 10 [2025-03-04 07:40:37,903 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 07:40:37,903 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 24 treesize of output 28 [2025-03-04 07:40:38,021 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-04 07:40:38,059 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-03-04 07:40:38,059 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 31 treesize of output 37 [2025-03-04 07:40:38,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 30 [2025-03-04 07:40:38,332 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2025-03-04 07:40:38,332 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 38 treesize of output 58 [2025-03-04 07:40:38,468 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-04 07:40:38,513 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-03-04 07:40:38,513 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 31 treesize of output 37 [2025-03-04 07:40:38,707 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 48 treesize of output 30 [2025-03-04 07:40:38,733 INFO L349 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2025-03-04 07:40:38,733 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 31 treesize of output 52 [2025-03-04 07:40:38,813 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 38 proven. 203 refuted. 0 times theorem prover too weak. 40 trivial. 24 not checked. [2025-03-04 07:40:38,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:38,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95427412] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:38,899 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:38,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21] total 29 [2025-03-04 07:40:38,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031564442] [2025-03-04 07:40:38,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:38,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-04 07:40:38,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:38,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-04 07:40:38,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=754, Unknown=1, NotChecked=56, Total=930 [2025-03-04 07:40:38,900 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 30 states, 29 states have (on average 5.344827586206897) internal successors, (155), 28 states have internal predecessors, (155), 5 states have call successors, (5), 3 states have call predecessors, (5), 9 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:40:39,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:39,725 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2025-03-04 07:40:39,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 07:40:39,726 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 5.344827586206897) internal successors, (155), 28 states have internal predecessors, (155), 5 states have call successors, (5), 3 states have call predecessors, (5), 9 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 141 [2025-03-04 07:40:39,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:39,727 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:40:39,727 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 07:40:39,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 145 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 486 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=1547, Unknown=1, NotChecked=84, Total=1980 [2025-03-04 07:40:39,727 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 120 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 843 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:39,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 661 Invalid, 843 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 695 Invalid, 0 Unknown, 134 Unchecked, 0.5s Time] [2025-03-04 07:40:39,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 07:40:39,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 169. [2025-03-04 07:40:39,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 136 states have (on average 1.3308823529411764) 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-04 07:40:39,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 197 transitions. [2025-03-04 07:40:39,730 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 197 transitions. Word has length 141 [2025-03-04 07:40:39,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:39,730 INFO L471 AbstractCegarLoop]: Abstraction has 169 states and 197 transitions. [2025-03-04 07:40:39,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 5.344827586206897) internal successors, (155), 28 states have internal predecessors, (155), 5 states have call successors, (5), 3 states have call predecessors, (5), 9 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-04 07:40:39,730 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 197 transitions. [2025-03-04 07:40:39,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 07:40:39,731 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:39,731 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] [2025-03-04 07:40:39,740 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-04 07:40:39,936 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,SelfDestructingSolverStorable26 [2025-03-04 07:40:39,936 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:39,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:39,939 INFO L85 PathProgramCache]: Analyzing trace with hash -477985909, now seen corresponding path program 1 times [2025-03-04 07:40:39,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:39,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077009882] [2025-03-04 07:40:39,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:39,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:39,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:40:40,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:40:40,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:40,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:41,303 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 195 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-04 07:40:41,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077009882] [2025-03-04 07:40:41,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077009882] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:41,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790192380] [2025-03-04 07:40:41,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:41,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:41,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:41,305 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:41,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-04 07:40:41,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:40:41,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:40:41,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:41,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:41,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 140 conjuncts are in the unsatisfiable core [2025-03-04 07:40:41,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:41,919 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-04 07:40:41,970 INFO L349 Elim1Store]: treesize reduction 30, result has 34.8 percent of original size [2025-03-04 07:40:41,971 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-04 07:40:41,978 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-04 07:40:42,193 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 (select |c_#valid| append_~node~0.base))))) is different from true [2025-03-04 07:40:42,221 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 22 treesize of output 10 [2025-03-04 07:40:42,248 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-03-04 07:40:42,248 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 24 treesize of output 28 [2025-03-04 07:40:42,260 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 14 treesize of output 9 [2025-03-04 07:40:42,468 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-04 07:40:42,525 INFO L349 Elim1Store]: treesize reduction 76, result has 29.0 percent of original size [2025-03-04 07:40:42,525 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 42 treesize of output 40 [2025-03-04 07:40:42,537 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-04 07:40:42,862 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-04 07:40:42,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2025-03-04 07:40:42,877 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 40 treesize of output 9 [2025-03-04 07:40:42,903 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-04 07:40:42,903 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-04 07:40:43,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:43,374 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-04 07:40:43,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 19 [2025-03-04 07:40:43,390 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 30 treesize of output 4 [2025-03-04 07:40:43,682 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-04 07:40:43,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:40:43,703 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-04 07:40:43,703 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 19 treesize of output 21 [2025-03-04 07:40:43,711 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:40:43,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:40:43,772 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 33 proven. 244 refuted. 0 times theorem prover too weak. 4 trivial. 24 not checked. [2025-03-04 07:40:43,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790192380] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:43,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 27] total 39 [2025-03-04 07:40:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004144482] [2025-03-04 07:40:43,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:43,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-04 07:40:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:43,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-04 07:40:43,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1463, Unknown=1, NotChecked=78, Total=1722 [2025-03-04 07:40:43,972 INFO L87 Difference]: Start difference. First operand 169 states and 197 transitions. Second operand has 40 states, 39 states have (on average 5.076923076923077) internal successors, (198), 36 states have internal predecessors, (198), 8 states have call successors, (8), 5 states have call predecessors, (8), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-04 07:40:48,074 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-04 07:40:49,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:49,117 INFO L93 Difference]: Finished difference Result 195 states and 223 transitions. [2025-03-04 07:40:49,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 07:40:49,117 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 5.076923076923077) internal successors, (198), 36 states have internal predecessors, (198), 8 states have call successors, (8), 5 states have call predecessors, (8), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) Word has length 141 [2025-03-04 07:40:49,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:49,118 INFO L225 Difference]: With dead ends: 195 [2025-03-04 07:40:49,118 INFO L226 Difference]: Without dead ends: 195 [2025-03-04 07:40:49,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=366, Invalid=2499, Unknown=1, NotChecked=104, Total=2970 [2025-03-04 07:40:49,119 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 433 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 22 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 138 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:49,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 707 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 797 Invalid, 1 Unknown, 138 Unchecked, 4.7s Time] [2025-03-04 07:40:49,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2025-03-04 07:40:49,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 168. [2025-03-04 07:40:49,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 136 states have (on average 1.3235294117647058) 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-04 07:40:49,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 196 transitions. [2025-03-04 07:40:49,122 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 196 transitions. Word has length 141 [2025-03-04 07:40:49,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:49,123 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 196 transitions. [2025-03-04 07:40:49,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 5.076923076923077) internal successors, (198), 36 states have internal predecessors, (198), 8 states have call successors, (8), 5 states have call predecessors, (8), 11 states have return successors, (11), 8 states have call predecessors, (11), 8 states have call successors, (11) [2025-03-04 07:40:49,123 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 196 transitions. [2025-03-04 07:40:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 07:40:49,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:49,124 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] [2025-03-04 07:40:49,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-03-04 07:40:49,324 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,SelfDestructingSolverStorable27 [2025-03-04 07:40:49,325 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:49,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:49,325 INFO L85 PathProgramCache]: Analyzing trace with hash 217041831, now seen corresponding path program 1 times [2025-03-04 07:40:49,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:49,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906112002] [2025-03-04 07:40:49,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:49,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 07:40:49,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 07:40:49,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:51,186 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 9 proven. 97 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2025-03-04 07:40:51,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:40:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906112002] [2025-03-04 07:40:51,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906112002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:51,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [648585866] [2025-03-04 07:40:51,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:51,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:40:51,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:40:51,188 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:40:51,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-04 07:40:51,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 07:40:51,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 07:40:51,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:51,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:40:51,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-03-04 07:40:51,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:40:51,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:51,547 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:40:51,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:40:51,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:40:51,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:40:51,607 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-04 07:40:51,842 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 31 treesize of output 22 [2025-03-04 07:40:51,857 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-03-04 07:40:51,857 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 23 treesize of output 24 [2025-03-04 07:40:51,992 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 31 treesize of output 22 [2025-03-04 07:40:52,001 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:40:52,001 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-04 07:40:52,106 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 31 treesize of output 22 [2025-03-04 07:40:52,116 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:40:52,116 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-04 07:40:52,221 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 31 treesize of output 22 [2025-03-04 07:40:52,235 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:40:52,235 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-04 07:40:52,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2025-03-04 07:40:52,349 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:40:52,349 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-04 07:40:52,462 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 31 treesize of output 22 [2025-03-04 07:40:52,472 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-03-04 07:40:52,472 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-04 07:40:52,519 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 07:40:52,519 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 30 treesize of output 12 [2025-03-04 07:40:52,539 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 6 proven. 94 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2025-03-04 07:40:52,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:40:56,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [648585866] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:40:56,633 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:40:56,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16] total 27 [2025-03-04 07:40:56,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635209560] [2025-03-04 07:40:56,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:40:56,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 07:40:56,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:40:56,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 07:40:56,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=706, Unknown=9, NotChecked=0, Total=812 [2025-03-04 07:40:56,634 INFO L87 Difference]: Start difference. First operand 168 states and 196 transitions. Second operand has 28 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:40:57,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:40:57,706 INFO L93 Difference]: Finished difference Result 254 states and 287 transitions. [2025-03-04 07:40:57,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 07:40:57,706 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 143 [2025-03-04 07:40:57,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:40:57,708 INFO L225 Difference]: With dead ends: 254 [2025-03-04 07:40:57,708 INFO L226 Difference]: Without dead ends: 254 [2025-03-04 07:40:57,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 156 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=307, Invalid=1938, Unknown=11, NotChecked=0, Total=2256 [2025-03-04 07:40:57,709 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 369 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 928 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 928 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 07:40:57,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 588 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 928 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 07:40:57,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2025-03-04 07:40:57,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 166. [2025-03-04 07:40:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 137 states have (on average 1.27007299270073) internal successors, (174), 154 states have internal predecessors, (174), 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-04 07:40:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 190 transitions. [2025-03-04 07:40:57,712 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 190 transitions. Word has length 143 [2025-03-04 07:40:57,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:40:57,712 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 190 transitions. [2025-03-04 07:40:57,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.8518518518518516) internal successors, (104), 27 states have internal predecessors, (104), 3 states have call successors, (3), 2 states have call predecessors, (3), 6 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 07:40:57,712 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2025-03-04 07:40:57,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-04 07:40:57,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:40:57,713 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] [2025-03-04 07:40:57,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-03-04 07:40:57,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 07:40:57,918 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-03-04 07:40:57,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:40:57,918 INFO L85 PathProgramCache]: Analyzing trace with hash 217041832, now seen corresponding path program 1 times [2025-03-04 07:40:57,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:40:57,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-04 07:40:57,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:40:57,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:40:57,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 07:40:58,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 07:40:58,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:40:58,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 37 proven. 212 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2025-03-04 07:41:00,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723497505] [2025-03-04 07:41:00,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723497505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:00,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883072041] [2025-03-04 07:41:00,686 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:00,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:00,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:00,689 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:00,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-04 07:41:00,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-04 07:41:01,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-04 07:41:01,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:01,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:01,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 1198 conjuncts, 210 conjuncts are in the unsatisfiable core [2025-03-04 07:41:01,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:01,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:01,155 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-04 07:41:01,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-04 07:41:01,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-04 07:41:01,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:01,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:41:01,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-04 07:41:01,363 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 11 [2025-03-04 07:41:01,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-04 07:41:01,841 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-04 07:41:01,862 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-03-04 07:41:01,862 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 37 [2025-03-04 07:41:01,871 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 64 treesize of output 47 [2025-03-04 07:41:01,876 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 13 [2025-03-04 07:41:02,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:02,241 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 26 treesize of output 13 [2025-03-04 07:41:02,271 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-03-04 07:41:02,272 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 61 [2025-03-04 07:41:02,287 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 07:41:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 101 treesize of output 63 [2025-03-04 07:41:02,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:02,303 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-04 07:41:02,667 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 07:41:02,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 99 treesize of output 57 [2025-03-04 07:41:02,692 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2025-03-04 07:41:02,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 33 [2025-03-04 07:41:02,696 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 18 treesize of output 13 [2025-03-04 07:41:02,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:02,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-04 07:41:03,006 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2025-03-04 07:41:03,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2025-03-04 07:41:03,017 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-03-04 07:41:03,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 42 [2025-03-04 07:41:03,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:03,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 07:41:03,458 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2025-03-04 07:41:03,458 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-04 07:41:03,471 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-04 07:41:03,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 60 [2025-03-04 07:41:03,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 07:41:03,480 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 41 treesize of output 21 [2025-03-04 07:41:04,045 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 07:41:04,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 53 [2025-03-04 07:41:04,081 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2025-03-04 07:41:04,082 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 3 case distinctions, treesize of input 33 treesize of output 55 [2025-03-04 07:41:04,088 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 36 treesize of output 27 [2025-03-04 07:41:04,095 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 17 treesize of output 13 [2025-03-04 07:41:04,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 31 treesize of output 25 [2025-03-04 07:41:04,224 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 28 treesize of output 12 [2025-03-04 07:41:04,253 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 18 proven. 266 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 07:41:04,253 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:04,511 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base|) .cse3) 9))) (and (or (forall ((v_append_~node~0.base_158 Int) (v_ArrVal_6031 Int)) (or (< v_ArrVal_6031 9) (< (select (store |c_#length| v_append_~node~0.base_158 v_ArrVal_6031) .cse0) .cse1))) (forall ((v_ArrVal_6033 (Array Int Int))) (<= 0 (+ 5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6033) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))))) (forall ((v_ArrVal_6031 Int)) (or (< v_ArrVal_6031 9) (forall ((v_append_~node~0.base_158 Int)) (let ((.cse2 (store |c_#length| v_append_~node~0.base_158 v_ArrVal_6031))) (or (< (select .cse2 .cse0) .cse1) (forall ((v_ArrVal_6033 (Array Int Int)) (v_ArrVal_6032 (Array Int Int))) (<= (+ 9 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6033) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)) (select .cse2 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list2~0#1.base| v_ArrVal_6032) |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|)))))))))))) is different from false [2025-03-04 07:41:04,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883072041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:04,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 07:41:04,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33] total 50 [2025-03-04 07:41:04,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233873978] [2025-03-04 07:41:04,513 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:04,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-04 07:41:04,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:04,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-04 07:41:04,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2633, Unknown=1, NotChecked=104, Total=2970 [2025-03-04 07:41:04,515 INFO L87 Difference]: Start difference. First operand 166 states and 190 transitions. Second operand has 51 states, 50 states have (on average 4.12) internal successors, (206), 49 states have internal predecessors, (206), 11 states have call successors, (11), 3 states have call predecessors, (11), 11 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13)