./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/length_test03-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/length_test03-1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:25:38,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:25:38,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:25:38,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:25:38,318 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:25:38,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:25:38,344 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:25:38,344 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:25:38,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:25:38,344 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:25:38,345 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:25:38,345 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:25:38,345 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:25:38,345 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:25:38,346 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:25:38,346 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:25:38,347 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:25:38,347 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:38,348 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:25:38,348 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:25:38,349 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-jdk21/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 -> 6e9221de91e231efa38b63f264828813e89f68c8ac306a629b3513c0e7bf1ed0 [2025-02-08 06:25:38,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:25:38,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:25:38,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:25:38,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:25:38,579 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:25:38,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2025-02-08 06:25:39,738 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b175c91e8/fe763ddb30a34b049f0c515c4f2c9607/FLAG574e8cb8f [2025-02-08 06:25:40,027 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:25:40,028 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/length_test03-1.i [2025-02-08 06:25:40,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b175c91e8/fe763ddb30a34b049f0c515c4f2c9607/FLAG574e8cb8f [2025-02-08 06:25:40,047 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b175c91e8/fe763ddb30a34b049f0c515c4f2c9607 [2025-02-08 06:25:40,051 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:25:40,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:25:40,054 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:40,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:25:40,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:25:40,058 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,060 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@425fb47f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40, skipping insertion in model container [2025-02-08 06:25:40,060 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,081 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:25:40,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:40,341 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:25:40,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:25:40,390 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:25:40,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40 WrapperNode [2025-02-08 06:25:40,391 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:25:40,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:40,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:25:40,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:25:40,396 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,404 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,423 INFO L138 Inliner]: procedures = 123, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 92 [2025-02-08 06:25:40,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:25:40,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:25:40,424 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:25:40,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:25:40,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,432 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,443 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-02-08 06:25:40,444 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,444 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,449 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,451 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,453 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,455 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:25:40,455 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:25:40,455 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:25:40,455 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:25:40,456 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (1/1) ... [2025-02-08 06:25:40,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:25:40,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:40,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:25:40,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:25:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:25:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:25:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:25:40,509 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:25:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:25:40,510 INFO L130 BoogieDeclarations]: Found specification of procedure append [2025-02-08 06:25:40,510 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2025-02-08 06:25:40,571 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:25:40,573 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:25:40,810 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2025-02-08 06:25:40,810 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:25:40,820 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:25:40,823 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:25:40,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:40 BoogieIcfgContainer [2025-02-08 06:25:40,823 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:25:40,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:25:40,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:25:40,829 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:25:40,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:25:40" (1/3) ... [2025-02-08 06:25:40,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:40, skipping insertion in model container [2025-02-08 06:25:40,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:25:40" (2/3) ... [2025-02-08 06:25:40,831 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f50fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:25:40, skipping insertion in model container [2025-02-08 06:25:40,831 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:25:40" (3/3) ... [2025-02-08 06:25:40,832 INFO L128 eAbstractionObserver]: Analyzing ICFG length_test03-1.i [2025-02-08 06:25:40,844 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:25:40,846 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG length_test03-1.i that has 2 procedures, 125 locations, 1 initial locations, 4 loop locations, and 59 error locations. [2025-02-08 06:25:40,879 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:25:40,893 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;@12aaa864, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:25:40,893 INFO L334 AbstractCegarLoop]: Starting to check reachability of 59 error locations. [2025-02-08 06:25:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 62 states have (on average 2.064516129032258) internal successors, (128), 121 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:40,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:25:40,899 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:40,899 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:25:40,900 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-02-08 06:25:40,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:40,903 INFO L85 PathProgramCache]: Analyzing trace with hash 3487, now seen corresponding path program 1 times [2025-02-08 06:25:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:40,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183351840] [2025-02-08 06:25:40,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:40,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:40,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:25:40,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:25:40,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:40,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:41,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:41,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:41,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183351840] [2025-02-08 06:25:41,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183351840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:41,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:41,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:25:41,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143896023] [2025-02-08 06:25:41,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:41,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:41,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,060 INFO L87 Difference]: Start difference. First operand has 125 states, 62 states have (on average 2.064516129032258) internal successors, (128), 121 states have internal predecessors, (128), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:41,194 INFO L93 Difference]: Finished difference Result 161 states and 170 transitions. [2025-02-08 06:25:41,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:41,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:25:41,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:41,200 INFO L225 Difference]: With dead ends: 161 [2025-02-08 06:25:41,200 INFO L226 Difference]: Without dead ends: 159 [2025-02-08 06:25:41,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,203 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:41,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:41,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-02-08 06:25:41,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2025-02-08 06:25:41,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 61 states have (on average 2.0163934426229506) internal successors, (123), 117 states have internal predecessors, (123), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:41,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 127 transitions. [2025-02-08 06:25:41,241 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 127 transitions. Word has length 2 [2025-02-08 06:25:41,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:41,242 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 127 transitions. [2025-02-08 06:25:41,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 127 transitions. [2025-02-08 06:25:41,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2025-02-08 06:25:41,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:41,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1] [2025-02-08 06:25:41,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:25:41,242 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-02-08 06:25:41,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash 3488, now seen corresponding path program 1 times [2025-02-08 06:25:41,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:41,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437054442] [2025-02-08 06:25:41,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:41,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-08 06:25:41,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-08 06:25:41,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:41,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:41,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437054442] [2025-02-08 06:25:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437054442] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:41,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:41,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-08 06:25:41,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923918167] [2025-02-08 06:25:41,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:41,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:41,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:41,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:41,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,292 INFO L87 Difference]: Start difference. First operand 121 states and 127 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:41,369 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2025-02-08 06:25:41,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:41,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2025-02-08 06:25:41,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:41,371 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:25:41,371 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:25:41,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,371 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:41,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 184 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:25:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-02-08 06:25:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:41,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 125 transitions. [2025-02-08 06:25:41,377 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 125 transitions. Word has length 2 [2025-02-08 06:25:41,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:41,379 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 125 transitions. [2025-02-08 06:25:41,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 125 transitions. [2025-02-08 06:25:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:25:41,380 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:41,380 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:25:41,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:25:41,380 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-02-08 06:25:41,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:41,380 INFO L85 PathProgramCache]: Analyzing trace with hash 103923881, now seen corresponding path program 1 times [2025-02-08 06:25:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682412117] [2025-02-08 06:25:41,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:41,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:41,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:25:41,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:25:41,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:41,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682412117] [2025-02-08 06:25:41,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682412117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:41,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:41,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943683872] [2025-02-08 06:25:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:41,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:41,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,483 INFO L87 Difference]: Start difference. First operand 119 states and 125 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:41,591 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2025-02-08 06:25:41,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:41,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:25:41,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:41,594 INFO L225 Difference]: With dead ends: 134 [2025-02-08 06:25:41,594 INFO L226 Difference]: Without dead ends: 134 [2025-02-08 06:25:41,594 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-02-08 06:25:41,594 INFO L435 NwaCegarLoop]: 110 mSDtfsCounter, 23 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:41,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:41,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2025-02-08 06:25:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 121. [2025-02-08 06:25:41,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9384615384615385) internal successors, (126), 117 states have internal predecessors, (126), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:41,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 130 transitions. [2025-02-08 06:25:41,603 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 130 transitions. Word has length 5 [2025-02-08 06:25:41,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:41,603 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 130 transitions. [2025-02-08 06:25:41,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,606 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 130 transitions. [2025-02-08 06:25:41,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-02-08 06:25:41,606 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:41,606 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-02-08 06:25:41,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:25:41,606 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-02-08 06:25:41,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:41,608 INFO L85 PathProgramCache]: Analyzing trace with hash 103923882, now seen corresponding path program 1 times [2025-02-08 06:25:41,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:41,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218970213] [2025-02-08 06:25:41,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:41,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:41,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-08 06:25:41,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-08 06:25:41,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:41,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:41,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218970213] [2025-02-08 06:25:41,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218970213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:41,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:41,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:41,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009854833] [2025-02-08 06:25:41,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:41,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:41,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:41,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:41,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,695 INFO L87 Difference]: Start difference. First operand 121 states and 130 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:41,764 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2025-02-08 06:25:41,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:41,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-02-08 06:25:41,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:41,766 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:25:41,766 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:25:41,766 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-02-08 06:25:41,766 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:41,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 185 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:41,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:25:41,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2025-02-08 06:25:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 115 states have internal predecessors, (124), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2025-02-08 06:25:41,777 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 5 [2025-02-08 06:25:41,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:41,777 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2025-02-08 06:25:41,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2025-02-08 06:25:41,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:25:41,780 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:41,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:41,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:25:41,780 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-02-08 06:25:41,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:41,780 INFO L85 PathProgramCache]: Analyzing trace with hash -1253370294, now seen corresponding path program 1 times [2025-02-08 06:25:41,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:41,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244834910] [2025-02-08 06:25:41,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:41,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:41,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:25:41,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:25:41,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:41,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:41,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:41,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244834910] [2025-02-08 06:25:41,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244834910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:41,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:41,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:41,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438755426] [2025-02-08 06:25:41,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:41,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:41,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:41,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:41,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:41,869 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:41,946 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2025-02-08 06:25:41,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:41,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:25:41,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:41,949 INFO L225 Difference]: With dead ends: 114 [2025-02-08 06:25:41,949 INFO L226 Difference]: Without dead ends: 114 [2025-02-08 06:25:41,949 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-02-08 06:25:41,950 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:41,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 136 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:41,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-02-08 06:25:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-02-08 06:25:41,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 65 states have (on average 1.8307692307692307) internal successors, (119), 110 states have internal predecessors, (119), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:41,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2025-02-08 06:25:41,958 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 11 [2025-02-08 06:25:41,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:41,958 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2025-02-08 06:25:41,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:41,958 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2025-02-08 06:25:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-08 06:25:41,958 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:41,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:41,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:25:41,959 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-02-08 06:25:41,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:41,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1253370293, now seen corresponding path program 1 times [2025-02-08 06:25:41,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:41,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264606887] [2025-02-08 06:25:41,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:41,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 06:25:41,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 06:25:41,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:41,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:42,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:42,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264606887] [2025-02-08 06:25:42,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264606887] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:42,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:42,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:25:42,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896039400] [2025-02-08 06:25:42,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:42,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:42,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:42,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:42,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:42,069 INFO L87 Difference]: Start difference. First operand 114 states and 123 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:42,117 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2025-02-08 06:25:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:42,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-08 06:25:42,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:42,118 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:25:42,118 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:25:42,118 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-02-08 06:25:42,118 INFO L435 NwaCegarLoop]: 90 mSDtfsCounter, 35 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:42,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:42,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:25:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-02-08 06:25:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 65 states have (on average 1.7538461538461538) internal successors, (114), 105 states have internal predecessors, (114), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:42,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2025-02-08 06:25:42,122 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 11 [2025-02-08 06:25:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:42,122 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2025-02-08 06:25:42,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:42,123 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2025-02-08 06:25:42,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:25:42,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:42,123 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:42,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:25:42,123 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-02-08 06:25:42,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -199773358, now seen corresponding path program 1 times [2025-02-08 06:25:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:42,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717069865] [2025-02-08 06:25:42,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:42,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:25:42,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:25:42,144 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:42,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:42,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:42,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:42,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717069865] [2025-02-08 06:25:42,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717069865] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:42,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:42,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 06:25:42,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029498745] [2025-02-08 06:25:42,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:42,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:25:42,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:42,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:25:42,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:42,343 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:42,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:42,559 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2025-02-08 06:25:42,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:25:42,560 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:25:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:42,560 INFO L225 Difference]: With dead ends: 213 [2025-02-08 06:25:42,560 INFO L226 Difference]: Without dead ends: 213 [2025-02-08 06:25:42,561 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-02-08 06:25:42,561 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 235 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:42,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 203 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2025-02-08 06:25:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 142. [2025-02-08 06:25:42,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 103 states have (on average 1.6601941747572815) internal successors, (171), 137 states have internal predecessors, (171), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:42,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 175 transitions. [2025-02-08 06:25:42,573 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 175 transitions. Word has length 12 [2025-02-08 06:25:42,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:42,574 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 175 transitions. [2025-02-08 06:25:42,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:42,574 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 175 transitions. [2025-02-08 06:25:42,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-08 06:25:42,574 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:42,574 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:42,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 06:25:42,575 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-02-08 06:25:42,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash -199773357, now seen corresponding path program 1 times [2025-02-08 06:25:42,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:42,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859686559] [2025-02-08 06:25:42,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:42,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:42,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-08 06:25:42,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-08 06:25:42,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:42,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:42,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:42,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:42,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859686559] [2025-02-08 06:25:42,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859686559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:42,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:42,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:25:42,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062044123] [2025-02-08 06:25:42,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:42,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:25:42,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:42,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:25:42,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:42,856 INFO L87 Difference]: Start difference. First operand 142 states and 175 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:43,096 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2025-02-08 06:25:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:25:43,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2025-02-08 06:25:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:43,098 INFO L225 Difference]: With dead ends: 221 [2025-02-08 06:25:43,098 INFO L226 Difference]: Without dead ends: 221 [2025-02-08 06:25:43,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:25:43,099 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 218 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:43,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 234 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:43,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-02-08 06:25:43,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 166. [2025-02-08 06:25:43,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 127 states have (on average 1.6771653543307086) internal successors, (213), 161 states have internal predecessors, (213), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:43,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 217 transitions. [2025-02-08 06:25:43,106 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 217 transitions. Word has length 12 [2025-02-08 06:25:43,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:43,106 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 217 transitions. [2025-02-08 06:25:43,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:43,106 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 217 transitions. [2025-02-08 06:25:43,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-08 06:25:43,107 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:43,107 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:43,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 06:25:43,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting appendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:43,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:43,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1376654375, now seen corresponding path program 1 times [2025-02-08 06:25:43,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:43,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671206587] [2025-02-08 06:25:43,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:43,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:43,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 06:25:43,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 06:25:43,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:43,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:43,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:43,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671206587] [2025-02-08 06:25:43,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671206587] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:43,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:43,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:25:43,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588688666] [2025-02-08 06:25:43,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:43,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:25:43,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:43,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:25:43,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:43,291 INFO L87 Difference]: Start difference. First operand 166 states and 217 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:43,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:43,415 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2025-02-08 06:25:43,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:43,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-08 06:25:43,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:43,416 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:25:43,416 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 06:25:43,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:25:43,417 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 22 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:43,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 268 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:43,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 06:25:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-02-08 06:25:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 146 states have (on average 1.6164383561643836) internal successors, (236), 180 states have internal predecessors, (236), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:25:43,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 242 transitions. [2025-02-08 06:25:43,424 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 242 transitions. Word has length 15 [2025-02-08 06:25:43,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:43,424 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 242 transitions. [2025-02-08 06:25:43,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 242 transitions. [2025-02-08 06:25:43,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-08 06:25:43,426 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:43,426 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 06:25:43,427 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-02-08 06:25:43,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1546394618, now seen corresponding path program 1 times [2025-02-08 06:25:43,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:43,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671572688] [2025-02-08 06:25:43,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:43,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:43,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 06:25:43,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 06:25:43,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:43,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:43,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:43,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:43,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671572688] [2025-02-08 06:25:43,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671572688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 06:25:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672876817] [2025-02-08 06:25:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:43,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:25:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:43,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:25:43,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:25:43,851 INFO L87 Difference]: Start difference. First operand 186 states and 242 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:44,015 INFO L93 Difference]: Finished difference Result 188 states and 241 transitions. [2025-02-08 06:25:44,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-08 06:25:44,016 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-08 06:25:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:44,017 INFO L225 Difference]: With dead ends: 188 [2025-02-08 06:25:44,017 INFO L226 Difference]: Without dead ends: 188 [2025-02-08 06:25:44,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:25:44,017 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 38 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:44,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 567 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:44,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2025-02-08 06:25:44,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2025-02-08 06:25:44,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 180 states have internal predecessors, (235), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:25:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 241 transitions. [2025-02-08 06:25:44,022 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 241 transitions. Word has length 21 [2025-02-08 06:25:44,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:44,022 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 241 transitions. [2025-02-08 06:25:44,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 241 transitions. [2025-02-08 06:25:44,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-08 06:25:44,023 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:44,023 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:44,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 06:25:44,024 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:44,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:44,024 INFO L85 PathProgramCache]: Analyzing trace with hash 267217788, now seen corresponding path program 1 times [2025-02-08 06:25:44,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:44,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592255804] [2025-02-08 06:25:44,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:44,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 06:25:44,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 06:25:44,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:44,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:44,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:44,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:44,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592255804] [2025-02-08 06:25:44,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592255804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:44,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:44,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-08 06:25:44,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719883341] [2025-02-08 06:25:44,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:44,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 06:25:44,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:44,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 06:25:44,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:25:44,358 INFO L87 Difference]: Start difference. First operand 186 states and 241 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:44,581 INFO L93 Difference]: Finished difference Result 222 states and 286 transitions. [2025-02-08 06:25:44,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:25:44,581 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-08 06:25:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:44,582 INFO L225 Difference]: With dead ends: 222 [2025-02-08 06:25:44,582 INFO L226 Difference]: Without dead ends: 222 [2025-02-08 06:25:44,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-02-08 06:25:44,583 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 144 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:44,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 500 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:25:44,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2025-02-08 06:25:44,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 153. [2025-02-08 06:25:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 114 states have (on average 1.5526315789473684) internal successors, (177), 147 states have internal predecessors, (177), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:25:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2025-02-08 06:25:44,587 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 23 [2025-02-08 06:25:44,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:44,587 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2025-02-08 06:25:44,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:25:44,587 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2025-02-08 06:25:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:25:44,588 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:44,588 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:44,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 06:25:44,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting appendErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:44,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:44,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1404941286, now seen corresponding path program 1 times [2025-02-08 06:25:44,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:44,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730686208] [2025-02-08 06:25:44,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:44,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:44,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:25:44,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:25:44,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:44,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:44,894 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:44,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730686208] [2025-02-08 06:25:44,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730686208] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:44,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476425314] [2025-02-08 06:25:44,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:44,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:44,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:44,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:44,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:25:44,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:25:45,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:25:45,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:45,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:45,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-02-08 06:25:45,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:45,047 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-02-08 06:25:45,104 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-02-08 06:25:45,200 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:25:45,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:25:45,226 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:25:45,226 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-02-08 06:25:45,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:45,238 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:45,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476425314] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:45,304 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:25:45,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2025-02-08 06:25:45,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108061230] [2025-02-08 06:25:45,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:45,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 06:25:45,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:45,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 06:25:45,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2025-02-08 06:25:45,306 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:25:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:45,685 INFO L93 Difference]: Finished difference Result 192 states and 220 transitions. [2025-02-08 06:25:45,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-08 06:25:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-08 06:25:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:45,687 INFO L225 Difference]: With dead ends: 192 [2025-02-08 06:25:45,687 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 06:25:45,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 2 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=250, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:25:45,687 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 110 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 154 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:45,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 330 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 406 Invalid, 0 Unknown, 154 Unchecked, 0.2s Time] [2025-02-08 06:25:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 06:25:45,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 156. [2025-02-08 06:25:45,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 150 states have internal predecessors, (180), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:25:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 187 transitions. [2025-02-08 06:25:45,691 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 187 transitions. Word has length 31 [2025-02-08 06:25:45,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:45,691 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 187 transitions. [2025-02-08 06:25:45,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:25:45,691 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 187 transitions. [2025-02-08 06:25:45,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:25:45,692 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:45,692 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:45,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:45,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:25:45,893 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting appendErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:45,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1404941285, now seen corresponding path program 1 times [2025-02-08 06:25:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179467904] [2025-02-08 06:25:45,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:45,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:25:45,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:25:45,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:45,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:46,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:46,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179467904] [2025-02-08 06:25:46,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179467904] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:46,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041398915] [2025-02-08 06:25:46,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:46,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:46,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:46,205 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:46,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:25:46,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:25:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:25:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:46,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:46,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 06:25:46,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:46,320 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-02-08 06:25:46,326 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-02-08 06:25:46,366 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-02-08 06:25:46,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:46,430 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-02-08 06:25:46,435 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:46,435 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-02-08 06:25:46,469 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:25:46,469 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-02-08 06:25:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2025-02-08 06:25:46,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:46,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041398915] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:46,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:25:46,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2025-02-08 06:25:46,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528120686] [2025-02-08 06:25:46,739 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:46,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-08 06:25:46,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:46,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-08 06:25:46,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=198, Unknown=1, NotChecked=28, Total=272 [2025-02-08 06:25:46,740 INFO L87 Difference]: Start difference. First operand 156 states and 187 transitions. Second operand has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:25:47,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:47,187 INFO L93 Difference]: Finished difference Result 230 states and 272 transitions. [2025-02-08 06:25:47,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:25:47,188 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2025-02-08 06:25:47,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:47,189 INFO L225 Difference]: With dead ends: 230 [2025-02-08 06:25:47,189 INFO L226 Difference]: Without dead ends: 230 [2025-02-08 06:25:47,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=375, Unknown=1, NotChecked=40, Total=506 [2025-02-08 06:25:47,190 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 235 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 157 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:47,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 424 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 411 Invalid, 0 Unknown, 157 Unchecked, 0.3s Time] [2025-02-08 06:25:47,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2025-02-08 06:25:47,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 203. [2025-02-08 06:25:47,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 163 states have (on average 1.5030674846625767) internal successors, (245), 194 states have internal predecessors, (245), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:25:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 254 transitions. [2025-02-08 06:25:47,197 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 254 transitions. Word has length 31 [2025-02-08 06:25:47,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:47,197 INFO L471 AbstractCegarLoop]: Abstraction has 203 states and 254 transitions. [2025-02-08 06:25:47,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.9166666666666665) internal successors, (47), 11 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:25:47,197 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 254 transitions. [2025-02-08 06:25:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-02-08 06:25:47,199 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:47,199 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:47,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:47,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:47,400 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:47,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:47,400 INFO L85 PathProgramCache]: Analyzing trace with hash -461011310, now seen corresponding path program 1 times [2025-02-08 06:25:47,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:47,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56949059] [2025-02-08 06:25:47,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:47,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:47,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-08 06:25:47,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-08 06:25:47,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:47,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:47,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:47,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:47,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56949059] [2025-02-08 06:25:47,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56949059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:25:47,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:25:47,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:25:47,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110811642] [2025-02-08 06:25:47,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:25:47,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:25:47,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:47,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:25:47,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:25:47,480 INFO L87 Difference]: Start difference. First operand 203 states and 254 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:25:47,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:47,493 INFO L93 Difference]: Finished difference Result 192 states and 229 transitions. [2025-02-08 06:25:47,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:25:47,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2025-02-08 06:25:47,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:47,494 INFO L225 Difference]: With dead ends: 192 [2025-02-08 06:25:47,494 INFO L226 Difference]: Without dead ends: 192 [2025-02-08 06:25:47,494 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-02-08 06:25:47,494 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:47,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 191 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:25:47,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-02-08 06:25:47,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 178. [2025-02-08 06:25:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 138 states have (on average 1.4782608695652173) internal successors, (204), 169 states have internal predecessors, (204), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-02-08 06:25:47,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 213 transitions. [2025-02-08 06:25:47,500 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 213 transitions. Word has length 30 [2025-02-08 06:25:47,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:47,500 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 213 transitions. [2025-02-08 06:25:47,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:25:47,501 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 213 transitions. [2025-02-08 06:25:47,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-08 06:25:47,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:47,501 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:47,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 06:25:47,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting appendErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:47,502 INFO L85 PathProgramCache]: Analyzing trace with hash -926586689, now seen corresponding path program 1 times [2025-02-08 06:25:47,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:47,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141026387] [2025-02-08 06:25:47,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:47,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:25:47,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:25:47,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:47,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141026387] [2025-02-08 06:25:47,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141026387] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:47,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751497484] [2025-02-08 06:25:47,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:47,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:47,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:47,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:25:47,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-08 06:25:47,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-08 06:25:47,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:47,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:47,853 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-02-08 06:25:47,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:47,981 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:25:47,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:25:48,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:48,088 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:48,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-02-08 06:25:48,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:48,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-02-08 06:25:48,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:48,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751497484] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:48,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:48,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2025-02-08 06:25:48,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546387515] [2025-02-08 06:25:48,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:48,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 06:25:48,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:48,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 06:25:48,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2025-02-08 06:25:48,658 INFO L87 Difference]: Start difference. First operand 178 states and 213 transitions. Second operand has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:25:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:49,369 INFO L93 Difference]: Finished difference Result 183 states and 212 transitions. [2025-02-08 06:25:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:25:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2025-02-08 06:25:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:49,370 INFO L225 Difference]: With dead ends: 183 [2025-02-08 06:25:49,370 INFO L226 Difference]: Without dead ends: 183 [2025-02-08 06:25:49,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 48 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=290, Invalid=1270, Unknown=0, NotChecked=0, Total=1560 [2025-02-08 06:25:49,372 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 251 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:49,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 900 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:49,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2025-02-08 06:25:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2025-02-08 06:25:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.4087591240875912) internal successors, (193), 165 states have internal predecessors, (193), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:25:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2025-02-08 06:25:49,382 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 33 [2025-02-08 06:25:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:49,382 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2025-02-08 06:25:49,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.75) internal successors, (90), 22 states have internal predecessors, (90), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-02-08 06:25:49,383 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2025-02-08 06:25:49,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:25:49,384 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:49,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:49,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:49,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:49,588 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-02-08 06:25:49,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:49,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1580753262, now seen corresponding path program 1 times [2025-02-08 06:25:49,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:49,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403815618] [2025-02-08 06:25:49,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:49,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:49,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:25:49,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:25:49,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:49,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,025 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403815618] [2025-02-08 06:25:50,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403815618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:50,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007755834] [2025-02-08 06:25:50,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:50,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:50,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:50,027 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:50,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:25:50,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:25:50,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:25:50,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:50,139 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:50,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 06:25:50,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:50,150 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-02-08 06:25:50,194 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-02-08 06:25:50,216 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-02-08 06:25:50,273 INFO L349 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-02-08 06:25:50,273 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-02-08 06:25:50,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:25:50,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-02-08 06:25:50,345 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:50,491 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-02-08 06:25:50,885 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:50,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007755834] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:50,885 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:50,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 21 [2025-02-08 06:25:50,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901188136] [2025-02-08 06:25:50,886 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:50,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 06:25:50,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:50,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 06:25:50,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:25:50,887 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:25:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:51,383 INFO L93 Difference]: Finished difference Result 198 states and 228 transitions. [2025-02-08 06:25:51,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:51,383 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-08 06:25:51,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:51,384 INFO L225 Difference]: With dead ends: 198 [2025-02-08 06:25:51,384 INFO L226 Difference]: Without dead ends: 198 [2025-02-08 06:25:51,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:25:51,385 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 230 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:51,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 654 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-02-08 06:25:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 174. [2025-02-08 06:25:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.4014598540145986) internal successors, (192), 165 states have internal predecessors, (192), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:25:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 200 transitions. [2025-02-08 06:25:51,393 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 200 transitions. Word has length 39 [2025-02-08 06:25:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:51,394 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 200 transitions. [2025-02-08 06:25:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.666666666666667) internal successors, (98), 21 states have internal predecessors, (98), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:25:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 200 transitions. [2025-02-08 06:25:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-08 06:25:51,396 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:51,396 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:51,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:51,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-08 06:25:51,597 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:51,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:51,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1580753261, now seen corresponding path program 1 times [2025-02-08 06:25:51,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:51,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967011788] [2025-02-08 06:25:51,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:51,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:25:51,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:25:51,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:51,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:52,151 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:52,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:52,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967011788] [2025-02-08 06:25:52,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967011788] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:52,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111136564] [2025-02-08 06:25:52,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:52,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:52,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:52,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:52,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:25:52,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-08 06:25:52,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-08 06:25:52,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:52,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:52,272 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:25:52,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:52,285 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-02-08 06:25:52,290 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-02-08 06:25:52,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-08 06:25:52,391 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-02-08 06:25:52,395 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-02-08 06:25:52,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:52,494 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-02-08 06:25:52,502 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:25:52,502 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-02-08 06:25:52,585 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-02-08 06:25:52,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:52,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:52,877 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-02-08 06:25:52,897 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2025-02-08 06:25:52,952 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-02-08 06:25:53,106 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-02-08 06:25:53,204 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-02-08 06:25:53,297 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-02-08 06:25:53,389 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-02-08 06:25:53,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2025-02-08 06:25:53,568 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-02-08 06:25:53,689 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-02-08 06:25:53,876 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:53,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111136564] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:53,876 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:53,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 6] total 20 [2025-02-08 06:25:53,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50179593] [2025-02-08 06:25:53,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:53,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:25:53,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:53,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:25:53,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2025-02-08 06:25:53,877 INFO L87 Difference]: Start difference. First operand 174 states and 200 transitions. Second operand has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:25:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:54,473 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2025-02-08 06:25:54,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:54,475 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2025-02-08 06:25:54,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:54,476 INFO L225 Difference]: With dead ends: 196 [2025-02-08 06:25:54,476 INFO L226 Difference]: Without dead ends: 196 [2025-02-08 06:25:54,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 60 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=147, Invalid=665, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:25:54,477 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 158 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:54,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 548 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:25:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2025-02-08 06:25:54,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 174. [2025-02-08 06:25:54,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 137 states have (on average 1.3941605839416058) internal successors, (191), 165 states have internal predecessors, (191), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:25:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 199 transitions. [2025-02-08 06:25:54,485 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 199 transitions. Word has length 39 [2025-02-08 06:25:54,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:54,486 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 199 transitions. [2025-02-08 06:25:54,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.95) internal successors, (99), 20 states have internal predecessors, (99), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:25:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 199 transitions. [2025-02-08 06:25:54,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-08 06:25:54,488 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:54,488 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:54,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:25:54,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 06:25:54,693 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:54,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:54,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1479744462, now seen corresponding path program 1 times [2025-02-08 06:25:54,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:54,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965579585] [2025-02-08 06:25:54,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:54,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:54,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:25:54,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:25:54,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:54,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:55,130 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:55,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:55,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965579585] [2025-02-08 06:25:55,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965579585] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:55,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812977038] [2025-02-08 06:25:55,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:55,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:55,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:55,135 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:55,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:25:55,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-08 06:25:55,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-08 06:25:55,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:55,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:55,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-08 06:25:55,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:55,263 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-02-08 06:25:55,272 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:55,273 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-02-08 06:25:55,276 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-02-08 06:25:55,280 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-02-08 06:25:55,289 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-02-08 06:25:55,296 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-02-08 06:25:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:55,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:55,592 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1310 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1310) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0)) (forall ((v_ArrVal_1309 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1309) |c_ULTIMATE.start_main_~list2~0#1.base|) |c_ULTIMATE.start_main_~list2~0#1.offset|) 0))) is different from false [2025-02-08 06:25:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812977038] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:55,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:25:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 18 [2025-02-08 06:25:55,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526387830] [2025-02-08 06:25:55,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:25:55,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:55,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:25:55,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=260, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:25:55,594 INFO L87 Difference]: Start difference. First operand 174 states and 199 transitions. Second operand has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:56,039 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2025-02-08 06:25:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:25:56,040 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 40 [2025-02-08 06:25:56,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:56,041 INFO L225 Difference]: With dead ends: 247 [2025-02-08 06:25:56,041 INFO L226 Difference]: Without dead ends: 247 [2025-02-08 06:25:56,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=490, Unknown=1, NotChecked=46, Total=650 [2025-02-08 06:25:56,043 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 206 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 657 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 738 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:56,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 738 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 657 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:25:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-02-08 06:25:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 186. [2025-02-08 06:25:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.3741496598639455) internal successors, (202), 175 states have internal predecessors, (202), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:25:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 214 transitions. [2025-02-08 06:25:56,049 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 214 transitions. Word has length 40 [2025-02-08 06:25:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 214 transitions. [2025-02-08 06:25:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 15 states have internal predecessors, (49), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 214 transitions. [2025-02-08 06:25:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-02-08 06:25:56,050 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:56,050 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:56,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-08 06:25:56,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:25:56,255 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-02-08 06:25:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -159578700, now seen corresponding path program 1 times [2025-02-08 06:25:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725997540] [2025-02-08 06:25:56,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:56,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:25:56,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:25:56,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:56,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:57,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:57,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725997540] [2025-02-08 06:25:57,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725997540] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:57,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340008993] [2025-02-08 06:25:57,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:57,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:57,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:25:57,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-02-08 06:25:57,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-02-08 06:25:57,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:57,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-08 06:25:57,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:57,299 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-02-08 06:25:57,317 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:25:57,317 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-02-08 06:25:57,337 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-02-08 06:25:57,340 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-02-08 06:25:57,465 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-02-08 06:25:57,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2025-02-08 06:25:57,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:25:57,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:57,645 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~list2~0#1.offset| 4))) (and (forall ((v_ArrVal_1484 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1484) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_1485 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1485) |c_ULTIMATE.start_main_~list2~0#1.base|) .cse0) 0)))) is different from false [2025-02-08 06:25:57,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340008993] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:57,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:25:57,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 13] total 31 [2025-02-08 06:25:57,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029051588] [2025-02-08 06:25:57,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-08 06:25:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:57,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-08 06:25:57,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=860, Unknown=1, NotChecked=60, Total=1056 [2025-02-08 06:25:57,651 INFO L87 Difference]: Start difference. First operand 186 states and 214 transitions. Second operand has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:58,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:58,401 INFO L93 Difference]: Finished difference Result 252 states and 285 transitions. [2025-02-08 06:25:58,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:25:58,402 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2025-02-08 06:25:58,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:58,403 INFO L225 Difference]: With dead ends: 252 [2025-02-08 06:25:58,403 INFO L226 Difference]: Without dead ends: 252 [2025-02-08 06:25:58,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=329, Invalid=1654, Unknown=1, NotChecked=86, Total=2070 [2025-02-08 06:25:58,404 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 248 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 1211 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:58,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 751 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1211 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-08 06:25:58,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2025-02-08 06:25:58,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 196. [2025-02-08 06:25:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 155 states have (on average 1.3612903225806452) internal successors, (211), 185 states have internal predecessors, (211), 6 states have call successors, (6), 6 states have call predecessors, (6), 6 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 06:25:58,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2025-02-08 06:25:58,408 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 42 [2025-02-08 06:25:58,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:58,409 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2025-02-08 06:25:58,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.25) internal successors, (72), 28 states have internal predecessors, (72), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-08 06:25:58,409 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2025-02-08 06:25:58,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-02-08 06:25:58,409 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:58,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:58,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:58,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:58,614 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:25:58,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash 551181338, now seen corresponding path program 1 times [2025-02-08 06:25:58,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:58,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19149911] [2025-02-08 06:25:58,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:58,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:58,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:25:58,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:25:58,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:58,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:58,676 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:25:58,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:58,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19149911] [2025-02-08 06:25:58,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19149911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:58,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029209100] [2025-02-08 06:25:58,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:58,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:58,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:58,679 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:58,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:25:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 06:25:58,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 06:25:58,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:58,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:58,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-08 06:25:58,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:58,825 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:25:58,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:25:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-08 06:25:58,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029209100] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:25:58,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:25:58,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-08 06:25:58,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314699168] [2025-02-08 06:25:58,843 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:25:58,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:25:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:25:58,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:25:58,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:58,844 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:25:58,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:25:58,903 INFO L93 Difference]: Finished difference Result 245 states and 282 transitions. [2025-02-08 06:25:58,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:25:58,903 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 45 [2025-02-08 06:25:58,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:25:58,904 INFO L225 Difference]: With dead ends: 245 [2025-02-08 06:25:58,904 INFO L226 Difference]: Without dead ends: 245 [2025-02-08 06:25:58,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:25:58,905 INFO L435 NwaCegarLoop]: 95 mSDtfsCounter, 62 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:25:58,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 362 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:25:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2025-02-08 06:25:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 230. [2025-02-08 06:25:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 185 states have (on average 1.3837837837837839) internal successors, (256), 213 states have internal predecessors, (256), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (16), 10 states have call predecessors, (16), 10 states have call successors, (16) [2025-02-08 06:25:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 282 transitions. [2025-02-08 06:25:58,912 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 282 transitions. Word has length 45 [2025-02-08 06:25:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:25:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 282 transitions. [2025-02-08 06:25:58,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-02-08 06:25:58,912 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 282 transitions. [2025-02-08 06:25:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-02-08 06:25:58,913 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:25:58,913 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:25:58,920 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:25:59,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:59,114 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-02-08 06:25:59,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:25:59,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1973461100, now seen corresponding path program 1 times [2025-02-08 06:25:59,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:25:59,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645074274] [2025-02-08 06:25:59,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:59,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:25:59,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:25:59,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:25:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:59,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:25:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:25:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645074274] [2025-02-08 06:25:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645074274] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:25:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [391940939] [2025-02-08 06:25:59,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:25:59,480 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:25:59,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:25:59,482 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:25:59,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:25:59,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 06:25:59,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 06:25:59,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:25:59,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:25:59,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 475 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-02-08 06:25:59,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:25:59,649 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-02-08 06:25:59,650 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-02-08 06:25:59,687 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-02-08 06:25:59,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:59,742 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-02-08 06:25:59,756 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:25:59,756 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-02-08 06:25:59,830 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-02-08 06:25:59,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:25:59,875 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-02-08 06:25:59,887 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2025-02-08 06:25:59,887 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-02-08 06:25:59,933 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:25:59,934 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-02-08 06:25:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 11 not checked. [2025-02-08 06:25:59,961 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:00,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [391940939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:00,142 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:00,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2025-02-08 06:26:00,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921157665] [2025-02-08 06:26:00,143 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:00,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:26:00,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:00,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:26:00,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=318, Unknown=2, NotChecked=74, Total=462 [2025-02-08 06:26:00,143 INFO L87 Difference]: Start difference. First operand 230 states and 282 transitions. Second operand has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:26:00,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:00,821 INFO L93 Difference]: Finished difference Result 261 states and 310 transitions. [2025-02-08 06:26:00,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-08 06:26:00,824 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 51 [2025-02-08 06:26:00,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:00,825 INFO L225 Difference]: With dead ends: 261 [2025-02-08 06:26:00,825 INFO L226 Difference]: Without dead ends: 261 [2025-02-08 06:26:00,825 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=163, Invalid=711, Unknown=4, NotChecked=114, Total=992 [2025-02-08 06:26:00,826 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 259 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 271 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:00,826 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 429 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 501 Invalid, 0 Unknown, 271 Unchecked, 0.3s Time] [2025-02-08 06:26:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2025-02-08 06:26:00,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 162. [2025-02-08 06:26:00,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 128 states have (on average 1.3515625) internal successors, (173), 152 states have internal predecessors, (173), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (9), 5 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-08 06:26:00,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2025-02-08 06:26:00,835 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 51 [2025-02-08 06:26:00,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:00,835 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2025-02-08 06:26:00,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 5.176470588235294) internal successors, (88), 15 states have internal predecessors, (88), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:26:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2025-02-08 06:26:00,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:26:00,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:00,836 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:00,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:26:01,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:01,036 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting appendErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:01,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:01,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1139229833, now seen corresponding path program 1 times [2025-02-08 06:26:01,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:01,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575579110] [2025-02-08 06:26:01,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:01,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:01,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:26:01,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:26:01,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:01,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:01,497 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:01,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:01,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575579110] [2025-02-08 06:26:01,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575579110] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:01,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431449154] [2025-02-08 06:26:01,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:01,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:01,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:01,504 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:01,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:26:01,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:26:01,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:26:01,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:01,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:01,667 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 06:26:01,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:01,673 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-02-08 06:26:01,715 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-02-08 06:26:01,754 INFO L349 Elim1Store]: treesize reduction 38, result has 36.7 percent of original size [2025-02-08 06:26:01,755 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-02-08 06:26:01,776 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-02-08 06:26:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:01,778 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:01,882 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-02-08 06:26:02,161 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:02,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431449154] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:02,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:02,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 6, 6] total 19 [2025-02-08 06:26:02,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866229659] [2025-02-08 06:26:02,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:02,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:26:02,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:02,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:26:02,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2025-02-08 06:26:02,163 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:26:02,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:02,533 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2025-02-08 06:26:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:26:02,533 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-02-08 06:26:02,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:02,534 INFO L225 Difference]: With dead ends: 193 [2025-02-08 06:26:02,534 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 06:26:02,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=499, Unknown=0, NotChecked=0, Total=600 [2025-02-08 06:26:02,535 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 213 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:02,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 620 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:26:02,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 06:26:02,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2025-02-08 06:26:02,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 132 states have (on average 1.3333333333333333) internal successors, (176), 155 states have internal predecessors, (176), 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-02-08 06:26:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2025-02-08 06:26:02,542 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 57 [2025-02-08 06:26:02,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:02,543 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2025-02-08 06:26:02,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.578947368421052) internal successors, (106), 19 states have internal predecessors, (106), 6 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:26:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2025-02-08 06:26:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:26:02,543 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:02,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:02,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:02,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:02,745 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting appendErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:02,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:02,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1139229832, now seen corresponding path program 1 times [2025-02-08 06:26:02,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:02,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528290812] [2025-02-08 06:26:02,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:02,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:02,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:26:02,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:26:02,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:02,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,057 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:04,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528290812] [2025-02-08 06:26:04,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528290812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:04,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [17464886] [2025-02-08 06:26:04,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:04,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:04,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:04,061 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:04,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:26:04,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:26:04,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:26:04,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:04,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:04,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-02-08 06:26:04,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:04,238 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-02-08 06:26:04,243 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-02-08 06:26:04,306 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-02-08 06:26:04,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-02-08 06:26:04,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 06:26:04,424 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:26:04,424 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-02-08 06:26:04,427 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-02-08 06:26:04,491 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-02-08 06:26:04,515 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:04,515 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:04,842 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-02-08 06:26:04,863 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-02-08 06:26:04,966 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-02-08 06:26:05,133 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-02-08 06:26:05,318 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-02-08 06:26:05,440 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-02-08 06:26:05,556 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-02-08 06:26:05,659 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-02-08 06:26:05,759 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-02-08 06:26:05,855 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-02-08 06:26:05,963 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:26:05,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [17464886] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:05,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:05,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 7, 6] total 40 [2025-02-08 06:26:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140925874] [2025-02-08 06:26:05,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:05,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-02-08 06:26:05,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:05,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-02-08 06:26:05,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1514, Unknown=0, NotChecked=0, Total=1640 [2025-02-08 06:26:05,965 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:26:08,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:08,450 INFO L93 Difference]: Finished difference Result 277 states and 313 transitions. [2025-02-08 06:26:08,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-02-08 06:26:08,451 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-02-08 06:26:08,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:08,452 INFO L225 Difference]: With dead ends: 277 [2025-02-08 06:26:08,452 INFO L226 Difference]: Without dead ends: 277 [2025-02-08 06:26:08,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 108 SyntacticMatches, 8 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=849, Invalid=5631, Unknown=0, NotChecked=0, Total=6480 [2025-02-08 06:26:08,454 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 894 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 1414 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 1491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 1414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:08,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [896 Valid, 816 Invalid, 1491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 1414 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:26:08,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-02-08 06:26:08,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 164. [2025-02-08 06:26:08,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 132 states have (on average 1.3257575757575757) internal successors, (175), 154 states have internal predecessors, (175), 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-02-08 06:26:08,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 187 transitions. [2025-02-08 06:26:08,458 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 187 transitions. Word has length 57 [2025-02-08 06:26:08,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:08,458 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 187 transitions. [2025-02-08 06:26:08,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 3.275) internal successors, (131), 40 states have internal predecessors, (131), 6 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:26:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 187 transitions. [2025-02-08 06:26:08,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-08 06:26:08,459 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:08,459 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:08,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 06:26:08,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-08 06:26:08,663 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:08,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:08,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1712561515, now seen corresponding path program 2 times [2025-02-08 06:26:08,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:08,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185148950] [2025-02-08 06:26:08,664 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:26:08,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:08,685 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 06:26:08,695 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:26:08,695 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:26:08,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-08 06:26:08,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185148950] [2025-02-08 06:26:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185148950] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:08,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820823612] [2025-02-08 06:26:08,792 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:26:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:08,798 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:08,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:26:08,952 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 96 statements into 2 equivalence classes. [2025-02-08 06:26:09,166 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 96 of 96 statements. [2025-02-08 06:26:09,167 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:26:09,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:09,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 849 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 06:26:09,172 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:09,190 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-08 06:26:09,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:09,229 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2025-02-08 06:26:09,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820823612] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:09,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:09,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2025-02-08 06:26:09,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462660026] [2025-02-08 06:26:09,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:09,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-08 06:26:09,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:09,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-08 06:26:09,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:26:09,232 INFO L87 Difference]: Start difference. First operand 164 states and 187 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:26:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:09,268 INFO L93 Difference]: Finished difference Result 193 states and 202 transitions. [2025-02-08 06:26:09,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:26:09,268 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 96 [2025-02-08 06:26:09,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:09,269 INFO L225 Difference]: With dead ends: 193 [2025-02-08 06:26:09,269 INFO L226 Difference]: Without dead ends: 193 [2025-02-08 06:26:09,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 186 SyntacticMatches, 5 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-02-08 06:26:09,270 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 81 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:09,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 279 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:26:09,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-02-08 06:26:09,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 173. [2025-02-08 06:26:09,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 140 states have (on average 1.3428571428571427) internal successors, (188), 162 states have internal predecessors, (188), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 202 transitions. [2025-02-08 06:26:09,274 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 202 transitions. Word has length 96 [2025-02-08 06:26:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:09,275 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 202 transitions. [2025-02-08 06:26:09,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 8 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:26:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 202 transitions. [2025-02-08 06:26:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-02-08 06:26:09,275 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:09,275 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:09,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:09,478 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-02-08 06:26:09,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:09,478 INFO L85 PathProgramCache]: Analyzing trace with hash -978475302, now seen corresponding path program 3 times [2025-02-08 06:26:09,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:09,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090743325] [2025-02-08 06:26:09,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:26:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:09,504 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 6 equivalence classes. [2025-02-08 06:26:09,512 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 113 statements. [2025-02-08 06:26:09,512 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:26:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:09,766 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:26:09,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090743325] [2025-02-08 06:26:09,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090743325] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:09,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [666707336] [2025-02-08 06:26:09,767 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:26:09,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:09,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:09,770 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:09,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:26:09,940 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 113 statements into 6 equivalence classes. [2025-02-08 06:26:10,740 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 113 statements. [2025-02-08 06:26:10,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:26:10,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:10,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 549 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-02-08 06:26:10,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:10,837 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-02-08 06:26:10,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-02-08 06:26:10,990 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 129 proven. 13 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:26:10,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:11,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2025-02-08 06:26:11,127 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 56 treesize of output 54 [2025-02-08 06:26:11,201 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 78 treesize of output 74 [2025-02-08 06:26:11,441 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 118 proven. 24 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2025-02-08 06:26:11,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [666707336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:26:11,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:26:11,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 29 [2025-02-08 06:26:11,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19418397] [2025-02-08 06:26:11,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:11,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 06:26:11,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:11,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 06:26:11,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=700, Unknown=0, NotChecked=0, Total=812 [2025-02-08 06:26:11,443 INFO L87 Difference]: Start difference. First operand 173 states and 202 transitions. Second operand has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-08 06:26:12,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:12,038 INFO L93 Difference]: Finished difference Result 180 states and 207 transitions. [2025-02-08 06:26:12,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-08 06:26:12,039 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) Word has length 113 [2025-02-08 06:26:12,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:12,040 INFO L225 Difference]: With dead ends: 180 [2025-02-08 06:26:12,040 INFO L226 Difference]: Without dead ends: 180 [2025-02-08 06:26:12,041 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=408, Invalid=1848, Unknown=0, NotChecked=0, Total=2256 [2025-02-08 06:26:12,041 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 236 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 575 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:12,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 949 Invalid, 575 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:26:12,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2025-02-08 06:26:12,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 166. [2025-02-08 06:26:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 133 states have (on average 1.3458646616541354) internal successors, (179), 155 states have internal predecessors, (179), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 193 transitions. [2025-02-08 06:26:12,045 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 193 transitions. Word has length 113 [2025-02-08 06:26:12,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:12,045 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 193 transitions. [2025-02-08 06:26:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.689655172413793) internal successors, (107), 27 states have internal predecessors, (107), 4 states have call successors, (7), 3 states have call predecessors, (7), 5 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9) [2025-02-08 06:26:12,049 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 193 transitions. [2025-02-08 06:26:12,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-08 06:26:12,049 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:12,049 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:12,067 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:26:12,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:12,250 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-02-08 06:26:12,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1686604390, now seen corresponding path program 1 times [2025-02-08 06:26:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:12,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059793429] [2025-02-08 06:26:12,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:12,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 06:26:12,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 06:26:12,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:12,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 5 proven. 93 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-02-08 06:26:12,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:12,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059793429] [2025-02-08 06:26:12,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059793429] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903180248] [2025-02-08 06:26:12,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:12,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:12,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:12,934 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:12,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:26:13,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 06:26:13,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 06:26:13,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:13,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:13,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-08 06:26:13,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:13,261 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-02-08 06:26:13,300 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:26:13,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:26:13,357 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 06:26:13,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 06:26:13,364 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-02-08 06:26:13,418 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:26:13,418 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-02-08 06:26:13,530 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-02-08 06:26:13,549 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-02-08 06:26:13,549 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-02-08 06:26:13,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-02-08 06:26:13,746 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2025-02-08 06:26:13,746 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 22 [2025-02-08 06:26:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 15 proven. 36 refuted. 0 times theorem prover too weak. 35 trivial. 123 not checked. [2025-02-08 06:26:13,761 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:14,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2025-02-08 06:26:14,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903180248] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:14,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:14,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 20 [2025-02-08 06:26:14,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696617398] [2025-02-08 06:26:14,769 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:14,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:26:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:14,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:26:14,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=584, Unknown=2, NotChecked=102, Total=812 [2025-02-08 06:26:14,774 INFO L87 Difference]: Start difference. First operand 166 states and 193 transitions. Second operand has 21 states, 20 states have (on average 7.2) internal successors, (144), 19 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 06:26:15,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:15,215 INFO L93 Difference]: Finished difference Result 191 states and 218 transitions. [2025-02-08 06:26:15,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-08 06:26:15,215 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 7.2) internal successors, (144), 19 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 121 [2025-02-08 06:26:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:15,216 INFO L225 Difference]: With dead ends: 191 [2025-02-08 06:26:15,216 INFO L226 Difference]: Without dead ends: 191 [2025-02-08 06:26:15,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 161 SyntacticMatches, 21 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=267, Invalid=999, Unknown=2, NotChecked=138, Total=1406 [2025-02-08 06:26:15,217 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 80 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 207 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:15,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 510 Invalid, 688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 473 Invalid, 0 Unknown, 207 Unchecked, 0.2s Time] [2025-02-08 06:26:15,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2025-02-08 06:26:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 165. [2025-02-08 06:26:15,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 133 states have (on average 1.3383458646616542) internal successors, (178), 154 states have internal predecessors, (178), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:15,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 192 transitions. [2025-02-08 06:26:15,223 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 192 transitions. Word has length 121 [2025-02-08 06:26:15,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:15,223 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 192 transitions. [2025-02-08 06:26:15,223 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 7.2) internal successors, (144), 19 states have internal predecessors, (144), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-02-08 06:26:15,223 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 192 transitions. [2025-02-08 06:26:15,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-02-08 06:26:15,225 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:15,225 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:15,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:26:15,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-02-08 06:26:15,429 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:15,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:15,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1686604389, now seen corresponding path program 1 times [2025-02-08 06:26:15,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:15,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349593547] [2025-02-08 06:26:15,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:15,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:15,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 06:26:15,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 06:26:15,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:15,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:16,525 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 7 proven. 164 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-02-08 06:26:16,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:16,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349593547] [2025-02-08 06:26:16,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349593547] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:16,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843297392] [2025-02-08 06:26:16,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:16,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:16,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:16,529 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:16,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:26:16,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-02-08 06:26:16,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-02-08 06:26:16,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:16,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:16,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 104 conjuncts are in the unsatisfiable core [2025-02-08 06:26:16,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:17,010 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-02-08 06:26:17,054 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-02-08 06:26:17,055 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-02-08 06:26:17,076 INFO L349 Elim1Store]: treesize reduction 38, result has 29.6 percent of original size [2025-02-08 06:26:17,076 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 37 treesize of output 22 [2025-02-08 06:26:17,217 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-02-08 06:26:17,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 4 [2025-02-08 06:26:17,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:17,233 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-02-08 06:26:17,238 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:17,238 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-02-08 06:26:17,329 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-02-08 06:26:17,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-08 06:26:17,366 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2025-02-08 06:26:17,366 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 18 treesize of output 30 [2025-02-08 06:26:17,667 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2025-02-08 06:26:17,669 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-02-08 06:26:17,690 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-02-08 06:26:17,691 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 19 treesize of output 33 [2025-02-08 06:26:17,835 INFO L349 Elim1Store]: treesize reduction 24, result has 52.9 percent of original size [2025-02-08 06:26:17,835 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-02-08 06:26:17,911 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 25 proven. 162 refuted. 0 times theorem prover too weak. 3 trivial. 19 not checked. [2025-02-08 06:26:17,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:18,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843297392] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:18,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 35 [2025-02-08 06:26:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139035620] [2025-02-08 06:26:18,002 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:18,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-08 06:26:18,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:18,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-08 06:26:18,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1178, Unknown=1, NotChecked=70, Total=1406 [2025-02-08 06:26:18,004 INFO L87 Difference]: Start difference. First operand 165 states and 192 transitions. Second operand has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 31 states have internal predecessors, (179), 6 states have call successors, (6), 5 states have call predecessors, (6), 11 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-08 06:26:22,076 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-02-08 06:26:22,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:22,869 INFO L93 Difference]: Finished difference Result 190 states and 217 transitions. [2025-02-08 06:26:22,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-08 06:26:22,869 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 31 states have internal predecessors, (179), 6 states have call successors, (6), 5 states have call predecessors, (6), 11 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) Word has length 121 [2025-02-08 06:26:22,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:22,870 INFO L225 Difference]: With dead ends: 190 [2025-02-08 06:26:22,870 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:26:22,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 114 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 788 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=396, Invalid=2259, Unknown=1, NotChecked=100, Total=2756 [2025-02-08 06:26:22,871 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 330 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 24 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 132 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:22,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 652 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 731 Invalid, 1 Unknown, 132 Unchecked, 4.4s Time] [2025-02-08 06:26:22,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:26:22,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 164. [2025-02-08 06:26:22,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 133 states have (on average 1.330827067669173) internal successors, (177), 153 states have internal predecessors, (177), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:22,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 191 transitions. [2025-02-08 06:26:22,874 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 191 transitions. Word has length 121 [2025-02-08 06:26:22,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:22,875 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 191 transitions. [2025-02-08 06:26:22,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 31 states have internal predecessors, (179), 6 states have call successors, (6), 5 states have call predecessors, (6), 11 states have return successors, (11), 5 states have call predecessors, (11), 6 states have call successors, (11) [2025-02-08 06:26:22,875 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 191 transitions. [2025-02-08 06:26:22,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 06:26:22,876 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:22,876 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:22,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-02-08 06:26:23,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-08 06:26:23,076 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:23,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:23,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1624147561, now seen corresponding path program 1 times [2025-02-08 06:26:23,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:23,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339219358] [2025-02-08 06:26:23,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:23,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:23,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 06:26:23,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 06:26:23,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:23,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:24,546 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 5 proven. 118 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-02-08 06:26:24,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339219358] [2025-02-08 06:26:24,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339219358] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:24,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1259622404] [2025-02-08 06:26:24,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:24,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:24,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:24,548 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:24,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:26:24,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 06:26:24,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 06:26:24,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:24,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:24,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-02-08 06:26:24,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:24,884 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-02-08 06:26:24,890 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:24,891 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-02-08 06:26:24,898 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-02-08 06:26:24,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:26:24,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-08 06:26:25,098 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:25,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2025-02-08 06:26:25,101 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 52 treesize of output 36 [2025-02-08 06:26:25,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 32 [2025-02-08 06:26:25,307 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:25,308 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 42 treesize of output 39 [2025-02-08 06:26:25,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 34 [2025-02-08 06:26:25,568 INFO L349 Elim1Store]: treesize reduction 62, result has 44.1 percent of original size [2025-02-08 06:26:25,568 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 39 treesize of output 74 [2025-02-08 06:26:25,774 INFO L349 Elim1Store]: treesize reduction 214, result has 29.4 percent of original size [2025-02-08 06:26:25,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 55 treesize of output 101 [2025-02-08 06:26:25,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:25,778 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 1 case distinctions, treesize of input 93 treesize of output 60 [2025-02-08 06:26:26,052 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 66 treesize of output 49 [2025-02-08 06:26:26,055 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:26,055 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 48 treesize of output 32 [2025-02-08 06:26:26,075 INFO L349 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2025-02-08 06:26:26,075 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 33 treesize of output 62 [2025-02-08 06:26:26,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:26:26,103 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 35 proven. 144 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-08 06:26:26,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:30,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1259622404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:30,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:30,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 30] total 39 [2025-02-08 06:26:30,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985302276] [2025-02-08 06:26:30,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:30,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-02-08 06:26:30,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:30,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-02-08 06:26:30,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1471, Unknown=15, NotChecked=0, Total=1640 [2025-02-08 06:26:30,232 INFO L87 Difference]: Start difference. First operand 164 states and 191 transitions. Second operand has 40 states, 39 states have (on average 3.6923076923076925) internal successors, (144), 39 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-08 06:26:31,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:31,603 INFO L93 Difference]: Finished difference Result 184 states and 206 transitions. [2025-02-08 06:26:31,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-08 06:26:31,603 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.6923076923076925) internal successors, (144), 39 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 123 [2025-02-08 06:26:31,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:31,604 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:26:31,604 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 06:26:31,605 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=391, Invalid=3134, Unknown=15, NotChecked=0, Total=3540 [2025-02-08 06:26:31,605 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 274 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 1321 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 1359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:31,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 811 Invalid, 1359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1321 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:26:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 06:26:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 162. [2025-02-08 06:26:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 151 states have internal predecessors, (171), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:31,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 185 transitions. [2025-02-08 06:26:31,608 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 185 transitions. Word has length 123 [2025-02-08 06:26:31,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:31,609 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 185 transitions. [2025-02-08 06:26:31,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.6923076923076925) internal successors, (144), 39 states have internal predecessors, (144), 6 states have call successors, (6), 2 states have call predecessors, (6), 8 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-08 06:26:31,609 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 185 transitions. [2025-02-08 06:26:31,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-08 06:26:31,609 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:31,610 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:31,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:31,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-08 06:26:31,813 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:31,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:31,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1624147560, now seen corresponding path program 1 times [2025-02-08 06:26:31,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:31,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027396991] [2025-02-08 06:26:31,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:31,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:31,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 06:26:31,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 06:26:31,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:31,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 5 proven. 90 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-02-08 06:26:33,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027396991] [2025-02-08 06:26:33,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027396991] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:33,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665067108] [2025-02-08 06:26:33,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:33,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:33,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:33,701 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:33,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:26:33,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-08 06:26:34,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-08 06:26:34,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:34,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:34,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 1044 conjuncts, 162 conjuncts are in the unsatisfiable core [2025-02-08 06:26:34,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:34,033 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-02-08 06:26:34,042 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:34,042 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-02-08 06:26:34,050 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-02-08 06:26:34,055 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-02-08 06:26:34,134 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-02-08 06:26:34,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:26:34,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 18 [2025-02-08 06:26:34,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:34,500 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-02-08 06:26:34,514 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:34,514 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 41 treesize of output 30 [2025-02-08 06:26:34,520 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 61 treesize of output 41 [2025-02-08 06:26:34,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2025-02-08 06:26:34,750 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-02-08 06:26:34,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 32 [2025-02-08 06:26:34,766 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:34,766 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 30 treesize of output 27 [2025-02-08 06:26:34,775 INFO L349 Elim1Store]: treesize reduction 4, result has 77.8 percent of original size [2025-02-08 06:26:34,775 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 1 case distinctions, treesize of input 21 treesize of output 21 [2025-02-08 06:26:35,002 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-02-08 06:26:35,009 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2025-02-08 06:26:35,021 INFO L349 Elim1Store]: treesize reduction 33, result has 41.1 percent of original size [2025-02-08 06:26:35,021 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 30 treesize of output 27 [2025-02-08 06:26:35,081 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-02-08 06:26:35,324 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-02-08 06:26:35,359 INFO L349 Elim1Store]: treesize reduction 68, result has 50.4 percent of original size [2025-02-08 06:26:35,359 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 41 treesize of output 75 [2025-02-08 06:26:35,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 57 [2025-02-08 06:26:35,764 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 52 treesize of output 39 [2025-02-08 06:26:35,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:35,768 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 19 [2025-02-08 06:26:35,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:35,780 INFO L349 Elim1Store]: treesize reduction 33, result has 34.0 percent of original size [2025-02-08 06:26:35,780 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 23 treesize of output 29 [2025-02-08 06:26:35,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:35,787 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-02-08 06:26:35,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-08 06:26:35,896 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 56 treesize of output 40 [2025-02-08 06:26:35,990 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 27 proven. 178 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-08 06:26:35,990 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:36,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665067108] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:36,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:36,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 28] total 44 [2025-02-08 06:26:36,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879912137] [2025-02-08 06:26:36,227 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:36,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-08 06:26:36,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:36,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-08 06:26:36,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2179, Unknown=0, NotChecked=0, Total=2352 [2025-02-08 06:26:36,229 INFO L87 Difference]: Start difference. First operand 162 states and 185 transitions. Second operand has 45 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-08 06:26:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:38,397 INFO L93 Difference]: Finished difference Result 190 states and 216 transitions. [2025-02-08 06:26:38,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 06:26:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) Word has length 123 [2025-02-08 06:26:38,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:38,402 INFO L225 Difference]: With dead ends: 190 [2025-02-08 06:26:38,402 INFO L226 Difference]: Without dead ends: 190 [2025-02-08 06:26:38,404 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1297 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=464, Invalid=4506, Unknown=0, NotChecked=0, Total=4970 [2025-02-08 06:26:38,408 INFO L435 NwaCegarLoop]: 54 mSDtfsCounter, 421 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 1425 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 1425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:38,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1063 Invalid, 1464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 1425 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-08 06:26:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2025-02-08 06:26:38,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 163. [2025-02-08 06:26:38,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.2573529411764706) internal successors, (171), 152 states have internal predecessors, (171), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:38,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 185 transitions. [2025-02-08 06:26:38,419 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 185 transitions. Word has length 123 [2025-02-08 06:26:38,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:38,420 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 185 transitions. [2025-02-08 06:26:38,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 43 states have internal predecessors, (165), 8 states have call successors, (8), 3 states have call predecessors, (8), 9 states have return successors, (10), 9 states have call predecessors, (10), 8 states have call successors, (10) [2025-02-08 06:26:38,420 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 185 transitions. [2025-02-08 06:26:38,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 06:26:38,424 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:38,424 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:38,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-02-08 06:26:38,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-08 06:26:38,626 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:38,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:38,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1268368856, now seen corresponding path program 1 times [2025-02-08 06:26:38,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:38,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432512879] [2025-02-08 06:26:38,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:38,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:38,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 06:26:38,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 06:26:38,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:38,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:38,935 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-08 06:26:38,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:38,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432512879] [2025-02-08 06:26:38,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432512879] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:38,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:26:38,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:26:38,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222277945] [2025-02-08 06:26:38,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:38,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:26:38,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:38,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:26:38,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:26:38,936 INFO L87 Difference]: Start difference. First operand 163 states and 185 transitions. Second operand has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:26:39,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:39,138 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2025-02-08 06:26:39,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:26:39,139 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 128 [2025-02-08 06:26:39,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:39,140 INFO L225 Difference]: With dead ends: 179 [2025-02-08 06:26:39,141 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 06:26:39,141 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-02-08 06:26:39,141 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 99 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:39,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 308 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:26:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 06:26:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 165. [2025-02-08 06:26:39,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 138 states have (on average 1.2608695652173914) internal successors, (174), 154 states have internal predecessors, (174), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 188 transitions. [2025-02-08 06:26:39,144 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 188 transitions. Word has length 128 [2025-02-08 06:26:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:39,145 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 188 transitions. [2025-02-08 06:26:39,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.625) internal successors, (61), 9 states have internal predecessors, (61), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-02-08 06:26:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 188 transitions. [2025-02-08 06:26:39,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-02-08 06:26:39,147 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:39,147 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:26:39,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-08 06:26:39,147 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:39,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:39,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1268368855, now seen corresponding path program 1 times [2025-02-08 06:26:39,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:39,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150838401] [2025-02-08 06:26:39,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:39,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:39,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 06:26:39,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 06:26:39,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:39,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 59 proven. 9 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2025-02-08 06:26:39,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150838401] [2025-02-08 06:26:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150838401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:39,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210968704] [2025-02-08 06:26:39,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:39,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:39,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:39,618 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:39,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-08 06:26:39,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-08 06:26:39,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-08 06:26:39,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:39,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:39,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1072 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-08 06:26:39,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:39,962 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-02-08 06:26:39,974 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-02-08 06:26:39,991 WARN L873 $PredicateComparison]: unable to prove that (exists ((append_~node~0.base Int)) (and (not (= append_~node~0.base 0)) (= |c_#valid| (store |c_old(#valid)| append_~node~0.base (select |c_#valid| append_~node~0.base))))) is different from true [2025-02-08 06:26:40,026 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-02-08 06:26:40,064 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-02-08 06:26:40,106 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-02-08 06:26:40,147 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-02-08 06:26:40,188 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-02-08 06:26:40,227 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-02-08 06:26:40,236 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:40,236 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-02-08 06:26:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2025-02-08 06:26:40,246 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:26:40,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210968704] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:26:40,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:26:40,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 12 [2025-02-08 06:26:40,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56578783] [2025-02-08 06:26:40,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:26:40,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:26:40,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:40,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:26:40,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=92, Unknown=1, NotChecked=18, Total=132 [2025-02-08 06:26:40,247 INFO L87 Difference]: Start difference. First operand 165 states and 188 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:26:40,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:40,354 INFO L93 Difference]: Finished difference Result 162 states and 183 transitions. [2025-02-08 06:26:40,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:26:40,354 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 128 [2025-02-08 06:26:40,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:40,355 INFO L225 Difference]: With dead ends: 162 [2025-02-08 06:26:40,355 INFO L226 Difference]: Without dead ends: 162 [2025-02-08 06:26:40,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=150, Unknown=3, NotChecked=24, Total=210 [2025-02-08 06:26:40,356 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 81 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:40,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 109 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 133 Invalid, 0 Unknown, 68 Unchecked, 0.1s Time] [2025-02-08 06:26:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2025-02-08 06:26:40,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2025-02-08 06:26:40,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 135 states have (on average 1.2518518518518518) internal successors, (169), 151 states have internal predecessors, (169), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 183 transitions. [2025-02-08 06:26:40,361 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 183 transitions. Word has length 128 [2025-02-08 06:26:40,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:40,361 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 183 transitions. [2025-02-08 06:26:40,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:26:40,361 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 183 transitions. [2025-02-08 06:26:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-02-08 06:26:40,363 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:40,363 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-02-08 06:26:40,373 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2025-02-08 06:26:40,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:40,564 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:40,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:40,564 INFO L85 PathProgramCache]: Analyzing trace with hash -665344526, now seen corresponding path program 1 times [2025-02-08 06:26:40,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:40,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283618676] [2025-02-08 06:26:40,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:40,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:40,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 06:26:40,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 06:26:40,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:40,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 5 proven. 50 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-02-08 06:26:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283618676] [2025-02-08 06:26:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283618676] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560987452] [2025-02-08 06:26:41,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:41,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:41,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:41,248 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:41,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-08 06:26:41,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-02-08 06:26:41,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-02-08 06:26:41,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:41,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:41,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 1071 conjuncts, 58 conjuncts are in the unsatisfiable core [2025-02-08 06:26:41,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:41,613 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-02-08 06:26:41,620 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:41,620 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-02-08 06:26:41,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-08 06:26:41,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-02-08 06:26:41,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:26:41,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:26:41,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:26:41,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:26:41,896 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_#memory_$Pointer$#1.base|))) (and (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= .cse0 |c_ULTIMATE.start_main_~list2~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from false [2025-02-08 06:26:41,897 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_#memory_$Pointer$#1.base|))) (and (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= .cse0 |c_ULTIMATE.start_main_~list2~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)))))) (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))) is different from true [2025-02-08 06:26:41,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2025-02-08 06:26:41,963 WARN L851 $PredicateComparison]: unable to prove that (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) is different from false [2025-02-08 06:26:41,967 WARN L873 $PredicateComparison]: unable to prove that (or (< (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) |c_#StackHeapBarrier|) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) is different from true [2025-02-08 06:26:41,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2025-02-08 06:26:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 5 proven. 46 refuted. 0 times theorem prover too weak. 151 trivial. 7 not checked. [2025-02-08 06:26:41,992 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:26:42,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560987452] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:42,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:26:42,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 18 [2025-02-08 06:26:42,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447079472] [2025-02-08 06:26:42,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:26:42,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:26:42,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:26:42,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:26:42,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=253, Unknown=9, NotChecked=66, Total=380 [2025-02-08 06:26:42,065 INFO L87 Difference]: Start difference. First operand 162 states and 183 transitions. Second operand has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:26:42,298 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (< .cse3 |c_#StackHeapBarrier|))) (and (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_#memory_$Pointer$#1.base|))) (and (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) .cse0) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from false [2025-02-08 06:26:42,300 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (< .cse3 |c_#StackHeapBarrier|))) (and (or .cse0 (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_#memory_$Pointer$#1.base|))) (and (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1)) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1)) |c_#memory_$Pointer$#1.base|) (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_72| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|))))) (or (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_#memory_$Pointer$#1.base|))) (and (<= (+ (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| |c_ULTIMATE.start_main_~list~0#1.base|) |c_ULTIMATE.start_main_~list~0#1.offset|) 1) |c_#StackHeapBarrier|) (= .cse2 |c_ULTIMATE.start_main_~list2~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_71| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2)))))) .cse0) (<= (+ .cse3 1) |c_#StackHeapBarrier|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~list2~0#1.base|))))) is different from true [2025-02-08 06:26:42,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:26:42,434 INFO L93 Difference]: Finished difference Result 164 states and 185 transitions. [2025-02-08 06:26:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:26:42,434 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 129 [2025-02-08 06:26:42,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:26:42,435 INFO L225 Difference]: With dead ends: 164 [2025-02-08 06:26:42,435 INFO L226 Difference]: Without dead ends: 164 [2025-02-08 06:26:42,436 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 144 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=625, Unknown=13, NotChecked=162, Total=930 [2025-02-08 06:26:42,436 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 103 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 232 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:26:42,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 373 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 466 Invalid, 0 Unknown, 232 Unchecked, 0.2s Time] [2025-02-08 06:26:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2025-02-08 06:26:42,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2025-02-08 06:26:42,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 136 states have (on average 1.25) internal successors, (170), 152 states have internal predecessors, (170), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2025-02-08 06:26:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2025-02-08 06:26:42,440 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 129 [2025-02-08 06:26:42,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:26:42,440 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2025-02-08 06:26:42,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.7777777777777777) internal successors, (68), 16 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:26:42,441 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2025-02-08 06:26:42,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-02-08 06:26:42,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:26:42,441 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-02-08 06:26:42,450 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-02-08 06:26:42,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:42,642 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 56 more)] === [2025-02-08 06:26:42,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:26:42,642 INFO L85 PathProgramCache]: Analyzing trace with hash -4698737, now seen corresponding path program 1 times [2025-02-08 06:26:42,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:26:42,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393161434] [2025-02-08 06:26:42,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:42,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:26:42,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 06:26:42,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 06:26:42,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:42,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:53,659 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 9 proven. 166 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 06:26:53,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:26:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393161434] [2025-02-08 06:26:53,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393161434] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:26:53,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122857914] [2025-02-08 06:26:53,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:26:53,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:26:53,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:26:53,663 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:26:53,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-08 06:26:53,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-02-08 06:26:54,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-02-08 06:26:54,059 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:26:54,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:26:54,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 229 conjuncts are in the unsatisfiable core [2025-02-08 06:26:54,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:26:54,078 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-02-08 06:26:54,138 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:26:54,139 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-02-08 06:26:54,203 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-02-08 06:26:54,247 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-02-08 06:26:54,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-02-08 06:26:54,263 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 11 [2025-02-08 06:26:54,268 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 11 [2025-02-08 06:26:54,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:54,758 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 32 treesize of output 15 [2025-02-08 06:26:54,775 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:54,775 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 41 treesize of output 30 [2025-02-08 06:26:54,779 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 74 treesize of output 50 [2025-02-08 06:26:54,788 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 32 treesize of output 15 [2025-02-08 06:26:55,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:55,332 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:55,332 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 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:55,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:55,340 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:55,340 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 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:55,344 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2025-02-08 06:26:55,359 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:55,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:55,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:55,744 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:55,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:55,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:55,753 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:55,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:55,768 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:55,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:55,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:26:55,773 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 1 case distinctions, treesize of input 91 treesize of output 52 [2025-02-08 06:26:56,275 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-02-08 06:26:56,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:56,393 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:56,393 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:56,399 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:26:56,402 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2025-02-08 06:26:56,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2025-02-08 06:26:56,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 42 [2025-02-08 06:26:56,423 INFO L349 Elim1Store]: treesize reduction 50, result has 32.4 percent of original size [2025-02-08 06:26:56,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 30 [2025-02-08 06:26:56,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 06:26:56,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 06:26:57,073 INFO L349 Elim1Store]: treesize reduction 27, result has 15.6 percent of original size [2025-02-08 06:26:57,074 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 34