./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c00e63dc 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/list-ext3-properties/sll_circular_traversal-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 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 10:42:20,465 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 10:42:20,516 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-06 10:42:20,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 10:42:20,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 10:42:20,540 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 10:42:20,541 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 10:42:20,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 10:42:20,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 10:42:20,542 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 10:42:20,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 10:42:20,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 10:42:20,543 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 10:42:20,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 10:42:20,543 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 10:42:20,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 10:42:20,544 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 10:42:20,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:20,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 10:42:20,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 10:42:20,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 10:42:20,546 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 -> 5b4659b27a54f579598b48dab11e67b47aff28d030592fa757cae575afffc3b5 [2025-02-06 10:42:20,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 10:42:20,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 10:42:20,785 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 10:42:20,786 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 10:42:20,786 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 10:42:20,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-02-06 10:42:21,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97a72ffde/c57468e26d6e424e894444046d84d4cb/FLAG8d3934468 [2025-02-06 10:42:22,243 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 10:42:22,244 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/sll_circular_traversal-1.i [2025-02-06 10:42:22,250 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97a72ffde/c57468e26d6e424e894444046d84d4cb/FLAG8d3934468 [2025-02-06 10:42:22,544 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/97a72ffde/c57468e26d6e424e894444046d84d4cb [2025-02-06 10:42:22,545 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 10:42:22,546 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 10:42:22,547 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:22,547 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 10:42:22,550 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 10:42:22,550 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,551 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a63a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22, skipping insertion in model container [2025-02-06 10:42:22,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 10:42:22,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:22,714 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 10:42:22,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 10:42:22,755 INFO L204 MainTranslator]: Completed translation [2025-02-06 10:42:22,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22 WrapperNode [2025-02-06 10:42:22,755 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 10:42:22,756 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:22,756 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 10:42:22,756 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 10:42:22,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,766 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,782 INFO L138 Inliner]: procedures = 122, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2025-02-06 10:42:22,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 10:42:22,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 10:42:22,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 10:42:22,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 10:42:22,788 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,790 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,798 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 6 writes are split as follows [0, 6]. [2025-02-06 10:42:22,799 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,799 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,803 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,805 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,806 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 10:42:22,807 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 10:42:22,807 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 10:42:22,807 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 10:42:22,808 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (1/1) ... [2025-02-06 10:42:22,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 10:42:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:22,832 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-06 10:42:22,834 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-06 10:42:22,849 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-02-06 10:42:22,850 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-06 10:42:22,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-06 10:42:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-06 10:42:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 10:42:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 10:42:22,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 10:42:22,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 10:42:22,923 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 10:42:22,925 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 10:42:22,939 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-02-06 10:42:23,083 INFO L? ?]: Removed 65 outVars from TransFormulas that were not future-live. [2025-02-06 10:42:23,083 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 10:42:23,090 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 10:42:23,090 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 10:42:23,090 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:23 BoogieIcfgContainer [2025-02-06 10:42:23,090 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 10:42:23,092 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 10:42:23,092 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 10:42:23,095 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 10:42:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 10:42:22" (1/3) ... [2025-02-06 10:42:23,095 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce5cc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:23, skipping insertion in model container [2025-02-06 10:42:23,095 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 10:42:22" (2/3) ... [2025-02-06 10:42:23,096 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ce5cc31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 10:42:23, skipping insertion in model container [2025-02-06 10:42:23,096 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 10:42:23" (3/3) ... [2025-02-06 10:42:23,096 INFO L128 eAbstractionObserver]: Analyzing ICFG sll_circular_traversal-1.i [2025-02-06 10:42:23,106 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 10:42:23,107 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll_circular_traversal-1.i that has 2 procedures, 76 locations, 1 initial locations, 3 loop locations, and 28 error locations. [2025-02-06 10:42:23,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 10:42:23,139 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;@2c95d259, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 10:42:23,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-02-06 10:42:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 73 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:42:23,145 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:42:23,146 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,149 INFO L85 PathProgramCache]: Analyzing trace with hash 3693052, now seen corresponding path program 1 times [2025-02-06 10:42:23,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223148114] [2025-02-06 10:42:23,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:42:23,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:42:23,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,268 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-06 10:42:23,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223148114] [2025-02-06 10:42:23,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223148114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:23,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:23,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694360024] [2025-02-06 10:42:23,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:23,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:23,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:23,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:23,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:23,287 INFO L87 Difference]: Start difference. First operand has 75 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 73 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:23,341 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2025-02-06 10:42:23,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:23,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:42:23,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:23,345 INFO L225 Difference]: With dead ends: 71 [2025-02-06 10:42:23,346 INFO L226 Difference]: Without dead ends: 65 [2025-02-06 10:42:23,347 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-06 10:42:23,348 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:23,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 99 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:23,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-02-06 10:42:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-02-06 10:42:23,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.725) internal successors, (69), 64 states have internal predecessors, (69), 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-06 10:42:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2025-02-06 10:42:23,369 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 4 [2025-02-06 10:42:23,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:23,370 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2025-02-06 10:42:23,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,370 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2025-02-06 10:42:23,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2025-02-06 10:42:23,370 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,370 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2025-02-06 10:42:23,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 10:42:23,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,371 INFO L85 PathProgramCache]: Analyzing trace with hash 3693053, now seen corresponding path program 1 times [2025-02-06 10:42:23,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809163998] [2025-02-06 10:42:23,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-02-06 10:42:23,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-02-06 10:42:23,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,433 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-06 10:42:23,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809163998] [2025-02-06 10:42:23,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809163998] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:23,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:23,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:23,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798773496] [2025-02-06 10:42:23,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:23,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:23,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:23,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:23,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:23,435 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:23,467 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2025-02-06 10:42:23,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:23,468 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2025-02-06 10:42:23,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:23,468 INFO L225 Difference]: With dead ends: 62 [2025-02-06 10:42:23,468 INFO L226 Difference]: Without dead ends: 62 [2025-02-06 10:42:23,469 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-06 10:42:23,469 INFO L435 NwaCegarLoop]: 56 mSDtfsCounter, 12 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:23,469 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:23,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-02-06 10:42:23,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-02-06 10:42:23,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 40 states have (on average 1.65) internal successors, (66), 61 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2025-02-06 10:42:23,472 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 4 [2025-02-06 10:42:23,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:23,473 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2025-02-06 10:42:23,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,473 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2025-02-06 10:42:23,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:42:23,473 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,473 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:23,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 10:42:23,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,474 INFO L85 PathProgramCache]: Analyzing trace with hash -218884337, now seen corresponding path program 1 times [2025-02-06 10:42:23,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486260289] [2025-02-06 10:42:23,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:42:23,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:42:23,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,536 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-06 10:42:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486260289] [2025-02-06 10:42:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486260289] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:23,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:23,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:23,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619693453] [2025-02-06 10:42:23,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:23,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:23,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:23,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:23,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:23,538 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:23,571 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2025-02-06 10:42:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:23,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:42:23,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:23,571 INFO L225 Difference]: With dead ends: 60 [2025-02-06 10:42:23,571 INFO L226 Difference]: Without dead ends: 60 [2025-02-06 10:42:23,572 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-06 10:42:23,572 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:23,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 94 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:23,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-06 10:42:23,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-02-06 10:42:23,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.6) internal successors, (64), 59 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2025-02-06 10:42:23,575 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 9 [2025-02-06 10:42:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:23,575 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2025-02-06 10:42:23,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2025-02-06 10:42:23,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-02-06 10:42:23,576 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,576 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:23,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 10:42:23,576 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,577 INFO L85 PathProgramCache]: Analyzing trace with hash -218884336, now seen corresponding path program 1 times [2025-02-06 10:42:23,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515571607] [2025-02-06 10:42:23,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 10:42:23,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 10:42:23,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,669 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-06 10:42:23,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515571607] [2025-02-06 10:42:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515571607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:23,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 10:42:23,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011751327] [2025-02-06 10:42:23,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:23,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:23,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:23,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:23,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:23,670 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:23,696 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2025-02-06 10:42:23,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:23,697 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-02-06 10:42:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:23,697 INFO L225 Difference]: With dead ends: 58 [2025-02-06 10:42:23,697 INFO L226 Difference]: Without dead ends: 58 [2025-02-06 10:42:23,697 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-06 10:42:23,698 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 2 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:23,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:23,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-02-06 10:42:23,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2025-02-06 10:42:23,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.55) internal successors, (62), 57 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2025-02-06 10:42:23,701 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 9 [2025-02-06 10:42:23,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:23,701 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2025-02-06 10:42:23,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2025-02-06 10:42:23,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-02-06 10:42:23,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,702 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:23,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 10:42:23,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1005588952, now seen corresponding path program 1 times [2025-02-06 10:42:23,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309189941] [2025-02-06 10:42:23,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 10:42:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 10:42:23,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,748 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-06 10:42:23,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309189941] [2025-02-06 10:42:23,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309189941] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:23,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:23,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 10:42:23,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4934352] [2025-02-06 10:42:23,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:23,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 10:42:23,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:23,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 10:42:23,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 10:42:23,749 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:42:23,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:23,757 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2025-02-06 10:42:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 10:42:23,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2025-02-06 10:42:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:23,758 INFO L225 Difference]: With dead ends: 63 [2025-02-06 10:42:23,758 INFO L226 Difference]: Without dead ends: 63 [2025-02-06 10:42:23,758 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-06 10:42:23,759 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 4 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:23,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 113 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:23,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-02-06 10:42:23,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 59. [2025-02-06 10:42:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 58 states have internal predecessors, (63), 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-06 10:42:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2025-02-06 10:42:23,762 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 12 [2025-02-06 10:42:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:23,762 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2025-02-06 10:42:23,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-06 10:42:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2025-02-06 10:42:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-06 10:42:23,763 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:23,763 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:23,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 10:42:23,763 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:23,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:23,763 INFO L85 PathProgramCache]: Analyzing trace with hash -109443397, now seen corresponding path program 1 times [2025-02-06 10:42:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:23,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119681046] [2025-02-06 10:42:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:23,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:42:23,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:42:23,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:23,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119681046] [2025-02-06 10:42:23,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119681046] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:23,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341540627] [2025-02-06 10:42:23,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:23,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:23,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:23,865 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-06 10:42:23,867 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-06 10:42:23,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 10:42:23,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 10:42:23,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:23,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:23,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 10:42:23,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:23,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:23,989 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 10:42:24,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341540627] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:24,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:24,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-06 10:42:24,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191472489] [2025-02-06 10:42:24,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:24,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 10:42:24,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:24,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 10:42:24,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:24,025 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-06 10:42:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:24,050 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2025-02-06 10:42:24,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 10:42:24,053 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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 17 [2025-02-06 10:42:24,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:24,054 INFO L225 Difference]: With dead ends: 74 [2025-02-06 10:42:24,054 INFO L226 Difference]: Without dead ends: 74 [2025-02-06 10:42:24,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 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-06 10:42:24,054 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 8 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:24,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 169 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 10:42:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-06 10:42:24,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-02-06 10:42:24,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 73 states have internal predecessors, (78), 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-06 10:42:24,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2025-02-06 10:42:24,061 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 17 [2025-02-06 10:42:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:24,061 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2025-02-06 10:42:24,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.428571428571429) internal successors, (38), 7 states have internal predecessors, (38), 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-06 10:42:24,061 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2025-02-06 10:42:24,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:42:24,061 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:24,061 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:24,071 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-06 10:42:24,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:24,263 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:24,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:24,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1420075544, now seen corresponding path program 2 times [2025-02-06 10:42:24,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687963913] [2025-02-06 10:42:24,264 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:42:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:24,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-06 10:42:24,309 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:42:24,309 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:42:24,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:24,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-06 10:42:24,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:24,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687963913] [2025-02-06 10:42:24,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687963913] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:24,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:24,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:42:24,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144884052] [2025-02-06 10:42:24,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:24,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:24,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:24,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:24,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:24,465 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-06 10:42:24,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:24,559 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2025-02-06 10:42:24,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:42:24,560 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 32 [2025-02-06 10:42:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:24,561 INFO L225 Difference]: With dead ends: 72 [2025-02-06 10:42:24,561 INFO L226 Difference]: Without dead ends: 72 [2025-02-06 10:42:24,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:24,563 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 17 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:24,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-02-06 10:42:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2025-02-06 10:42:24,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2025-02-06 10:42:24,572 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 32 [2025-02-06 10:42:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:24,572 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2025-02-06 10:42:24,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-06 10:42:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2025-02-06 10:42:24,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-02-06 10:42:24,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:24,572 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:24,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 10:42:24,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:24,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1420075543, now seen corresponding path program 1 times [2025-02-06 10:42:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:24,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075288907] [2025-02-06 10:42:24,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:24,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 10:42:24,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 10:42:24,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:24,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:42:24,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:24,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075288907] [2025-02-06 10:42:24,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075288907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:24,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:24,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 10:42:24,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217584450] [2025-02-06 10:42:24,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:24,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 10:42:24,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:24,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 10:42:24,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 10:42:24,811 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-06 10:42:24,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:24,912 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2025-02-06 10:42:24,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 10:42:24,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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 32 [2025-02-06 10:42:24,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:24,913 INFO L225 Difference]: With dead ends: 79 [2025-02-06 10:42:24,913 INFO L226 Difference]: Without dead ends: 79 [2025-02-06 10:42:24,913 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 10:42:24,914 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:24,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 175 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:24,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-06 10:42:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2025-02-06 10:42:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.3114754098360655) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2025-02-06 10:42:24,917 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 32 [2025-02-06 10:42:24,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:24,917 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2025-02-06 10:42:24,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 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-06 10:42:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2025-02-06 10:42:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-02-06 10:42:24,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:24,918 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:24,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 10:42:24,918 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:24,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:24,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1321939749, now seen corresponding path program 1 times [2025-02-06 10:42:24,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:24,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880994436] [2025-02-06 10:42:24,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:24,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:24,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:42:24,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:42:24,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:24,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:25,528 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:42:25,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880994436] [2025-02-06 10:42:25,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880994436] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:25,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182317600] [2025-02-06 10:42:25,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:25,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:25,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:25,534 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-06 10:42:25,537 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-06 10:42:25,611 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 10:42:25,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 10:42:25,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:25,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:25,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 10:42:25,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:25,801 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-06 10:42:25,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 10:42:25,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-02-06 10:42:25,951 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:42:25,951 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:42:26,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182317600] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:26,205 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:26,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2025-02-06 10:42:26,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76260089] [2025-02-06 10:42:26,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-06 10:42:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:26,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-06 10:42:26,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=529, Unknown=0, NotChecked=0, Total=600 [2025-02-06 10:42:26,206 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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-06 10:42:26,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:26,502 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2025-02-06 10:42:26,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 10:42:26,502 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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 36 [2025-02-06 10:42:26,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:26,503 INFO L225 Difference]: With dead ends: 75 [2025-02-06 10:42:26,503 INFO L226 Difference]: Without dead ends: 75 [2025-02-06 10:42:26,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2025-02-06 10:42:26,504 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 16 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:26,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 638 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2025-02-06 10:42:26,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2025-02-06 10:42:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 74 states have internal predecessors, (79), 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-06 10:42:26,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2025-02-06 10:42:26,507 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 36 [2025-02-06 10:42:26,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:26,507 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2025-02-06 10:42:26,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.76) internal successors, (69), 25 states have internal predecessors, (69), 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-06 10:42:26,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2025-02-06 10:42:26,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:42:26,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:26,508 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:26,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 10:42:26,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:26,712 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:26,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:26,713 INFO L85 PathProgramCache]: Analyzing trace with hash 657879177, now seen corresponding path program 1 times [2025-02-06 10:42:26,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:26,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224469520] [2025-02-06 10:42:26,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:26,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:26,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:42:26,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:42:26,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:26,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:27,345 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 5 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-02-06 10:42:27,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224469520] [2025-02-06 10:42:27,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224469520] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:27,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353158390] [2025-02-06 10:42:27,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:27,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:27,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:27,347 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-06 10:42:27,348 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-06 10:42:27,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:42:27,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:42:27,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:27,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:27,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-02-06 10:42:27,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:27,475 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-06 10:42:27,501 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:42:27,502 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-06 10:42:27,522 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-06 10:42:27,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:42:27,578 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:42:27,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-02-06 10:42:27,721 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:42:27,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2025-02-06 10:42:27,740 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:27,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 25 [2025-02-06 10:42:27,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:27,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:27,945 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353158390] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:27,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:27,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 25 [2025-02-06 10:42:27,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209511075] [2025-02-06 10:42:27,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:27,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 10:42:27,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:27,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 10:42:27,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2025-02-06 10:42:27,947 INFO L87 Difference]: Start difference. First operand 75 states and 79 transitions. Second operand has 26 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 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-06 10:42:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:28,383 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2025-02-06 10:42:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 10:42:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 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 39 [2025-02-06 10:42:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:28,384 INFO L225 Difference]: With dead ends: 82 [2025-02-06 10:42:28,384 INFO L226 Difference]: Without dead ends: 82 [2025-02-06 10:42:28,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2025-02-06 10:42:28,385 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:28,385 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 363 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 10:42:28,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2025-02-06 10:42:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2025-02-06 10:42:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 10:42:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2025-02-06 10:42:28,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 39 [2025-02-06 10:42:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:28,389 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2025-02-06 10:42:28,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.84) internal successors, (71), 26 states have internal predecessors, (71), 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-06 10:42:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2025-02-06 10:42:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-02-06 10:42:28,389 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:28,389 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:28,398 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 10:42:28,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:28,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:28,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:28,595 INFO L85 PathProgramCache]: Analyzing trace with hash 657879178, now seen corresponding path program 1 times [2025-02-06 10:42:28,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:28,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036968093] [2025-02-06 10:42:28,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:28,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:28,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:42:28,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:42:28,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:28,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:29,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:29,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036968093] [2025-02-06 10:42:29,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036968093] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:29,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176798039] [2025-02-06 10:42:29,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:29,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:29,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:29,341 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-06 10:42:29,342 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-06 10:42:29,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 10:42:29,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 10:42:29,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:29,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:29,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 55 conjuncts are in the unsatisfiable core [2025-02-06 10:42:29,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:29,459 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-06 10:42:29,514 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:42:29,514 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-06 10:42:29,554 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-06 10:42:29,558 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-06 10:42:29,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:42:29,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:29,652 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:42:29,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-02-06 10:42:29,662 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-02-06 10:42:29,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-02-06 10:42:29,940 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:42:29,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2025-02-06 10:42:29,948 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:42:29,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 46 [2025-02-06 10:42:29,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:29,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 32 [2025-02-06 10:42:30,002 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:30,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 28 [2025-02-06 10:42:30,135 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:30,135 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:30,674 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 22 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:30,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176798039] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:30,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:30,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 34 [2025-02-06 10:42:30,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853214147] [2025-02-06 10:42:30,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:30,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-06 10:42:30,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:30,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-06 10:42:30,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1080, Unknown=0, NotChecked=0, Total=1190 [2025-02-06 10:42:30,676 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 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-06 10:42:31,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:31,530 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2025-02-06 10:42:31,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 10:42:31,531 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 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 39 [2025-02-06 10:42:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:31,533 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:42:31,533 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:42:31,534 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=214, Invalid=1856, Unknown=0, NotChecked=0, Total=2070 [2025-02-06 10:42:31,534 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 77 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:31,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 503 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 10:42:31,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:42:31,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-02-06 10:42:31,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 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-06 10:42:31,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2025-02-06 10:42:31,541 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 39 [2025-02-06 10:42:31,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:31,542 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2025-02-06 10:42:31,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 35 states have internal predecessors, (90), 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-06 10:42:31,542 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2025-02-06 10:42:31,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2025-02-06 10:42:31,542 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:31,542 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:31,551 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-06 10:42:31,743 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,SelfDestructingSolverStorable10 [2025-02-06 10:42:31,743 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:31,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:31,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1080568034, now seen corresponding path program 1 times [2025-02-06 10:42:31,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:31,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241720951] [2025-02-06 10:42:31,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:31,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:31,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 10:42:31,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 10:42:31,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:31,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 10:42:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241720951] [2025-02-06 10:42:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241720951] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 10:42:31,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 10:42:31,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 10:42:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487049931] [2025-02-06 10:42:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 10:42:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 10:42:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 10:42:31,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 10:42:31,964 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-06 10:42:32,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:32,064 INFO L93 Difference]: Finished difference Result 99 states and 109 transitions. [2025-02-06 10:42:32,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 10:42:32,064 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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 40 [2025-02-06 10:42:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:32,066 INFO L225 Difference]: With dead ends: 99 [2025-02-06 10:42:32,066 INFO L226 Difference]: Without dead ends: 99 [2025-02-06 10:42:32,067 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 10:42:32,068 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 87 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:32,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 133 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 10:42:32,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-06 10:42:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 90. [2025-02-06 10:42:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.2692307692307692) internal successors, (99), 89 states have internal predecessors, (99), 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-06 10:42:32,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2025-02-06 10:42:32,072 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 40 [2025-02-06 10:42:32,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:32,072 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2025-02-06 10:42:32,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 8 states have internal predecessors, (30), 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-06 10:42:32,072 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2025-02-06 10:42:32,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-06 10:42:32,072 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:32,072 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:32,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 10:42:32,072 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:32,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:32,073 INFO L85 PathProgramCache]: Analyzing trace with hash -837572868, now seen corresponding path program 1 times [2025-02-06 10:42:32,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:32,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121180776] [2025-02-06 10:42:32,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:32,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:32,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:42:32,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:42:32,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:32,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:33,122 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:33,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121180776] [2025-02-06 10:42:33,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121180776] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:33,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [456093361] [2025-02-06 10:42:33,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:33,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:33,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:33,127 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-06 10:42:33,129 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-06 10:42:33,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 10:42:33,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 10:42:33,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:33,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:33,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-02-06 10:42:33,248 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:33,253 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-06 10:42:33,303 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 10:42:33,304 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-06 10:42:33,378 INFO L349 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2025-02-06 10:42:33,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 22 [2025-02-06 10:42:33,456 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 10:42:33,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 10:42:33,541 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-06 10:42:33,652 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-02-06 10:42:33,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-02-06 10:42:33,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:42:33,703 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-06 10:42:33,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:42:33,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:33,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-02-06 10:42:33,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:42:33,830 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-06 10:42:33,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:42:33,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-02-06 10:42:33,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-02-06 10:42:33,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-02-06 10:42:33,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:34,007 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-06 10:42:34,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:42:34,108 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-06 10:42:34,109 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:34,205 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_1042) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|)) (+ 4 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) |c_ULTIMATE.start_main_~ptr~0#1.offset|))))) is different from false [2025-02-06 10:42:34,275 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1042 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1042) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-02-06 10:42:34,280 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| v_ArrVal_1042) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|))))) is different from false [2025-02-06 10:42:34,289 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2025-02-06 10:42:34,301 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 v_ArrVal_1036)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1033 .cse0)) v_ArrVal_1033))))) is different from false [2025-02-06 10:42:34,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 100 [2025-02-06 10:42:34,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-02-06 10:42:34,320 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 72 [2025-02-06 10:42:34,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 98 [2025-02-06 10:42:34,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2025-02-06 10:42:34,348 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 4)) (.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (or (not .cse0) (forall ((v_ArrVal_1037 (Array Int Int)) (v_arrayElimCell_46 Int) (v_arrayElimCell_48 Int) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) v_arrayElimCell_46) (+ 4 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042))) (or (forall ((v_arrayElimCell_46 Int) (v_arrayElimCell_48 Int)) (= (select (select .cse1 v_arrayElimCell_46) (+ 4 v_arrayElimCell_48)) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) .cse2) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse0))) is different from false [2025-02-06 10:42:34,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 41 [2025-02-06 10:42:34,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 199 treesize of output 186 [2025-02-06 10:42:34,610 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 54 [2025-02-06 10:42:34,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 70 [2025-02-06 10:42:34,741 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-02-06 10:42:34,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2025-02-06 10:42:34,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-02-06 10:42:34,769 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:34,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2025-02-06 10:42:34,775 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 10:42:34,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 36 treesize of output 24 [2025-02-06 10:42:34,778 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-02-06 10:42:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 19 not checked. [2025-02-06 10:42:35,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [456093361] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:35,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:35,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 16, 18] total 48 [2025-02-06 10:42:35,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472204949] [2025-02-06 10:42:35,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:35,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-02-06 10:42:35,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:35,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-02-06 10:42:35,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1601, Unknown=15, NotChecked=510, Total=2256 [2025-02-06 10:42:35,582 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand has 48 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 48 states have internal predecessors, (107), 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-06 10:42:36,163 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~data_init~0#1| 1)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|))) (and (= |c_ULTIMATE.start_sll_circular_create_~data#1| 1) (not .cse0) (or .cse0 (and (let ((.cse1 (select .cse2 0))) (or (= (select (select |c_#memory_int#1| .cse1) 4) 1) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| .cse1))) (= (select .cse3 0) 0) .cse4)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) .cse4 (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1037 (Array Int Int)) (v_ArrVal_1036 Int) (v_ArrVal_1033 (Array Int Int)) (v_ArrVal_1042 (Array Int Int))) (let ((.cse5 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1037) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1042) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1033) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1039) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)) (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (store .cse3 .cse5 v_ArrVal_1036)) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1038) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) 4)) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store .cse2 .cse5 (select v_ArrVal_1033 .cse5)) v_ArrVal_1033))))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) 1) (exists ((|v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35|)) (not (= |v_ULTIMATE.start_sll_circular_create_~new_head~0#1.base_35| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)))) (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset| 0))) is different from false [2025-02-06 10:42:37,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:37,317 INFO L93 Difference]: Finished difference Result 103 states and 111 transitions. [2025-02-06 10:42:37,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-06 10:42:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 48 states have internal predecessors, (107), 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 43 [2025-02-06 10:42:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:37,317 INFO L225 Difference]: With dead ends: 103 [2025-02-06 10:42:37,318 INFO L226 Difference]: Without dead ends: 103 [2025-02-06 10:42:37,318 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 685 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=385, Invalid=3280, Unknown=23, NotChecked=868, Total=4556 [2025-02-06 10:42:37,319 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 8 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 1772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 470 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:37,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 998 Invalid, 1772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1286 Invalid, 8 Unknown, 470 Unchecked, 0.7s Time] [2025-02-06 10:42:37,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-02-06 10:42:37,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 90. [2025-02-06 10:42:37,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 89 states have internal predecessors, (98), 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-06 10:42:37,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2025-02-06 10:42:37,321 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 43 [2025-02-06 10:42:37,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:37,321 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2025-02-06 10:42:37,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.2291666666666665) internal successors, (107), 48 states have internal predecessors, (107), 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-06 10:42:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2025-02-06 10:42:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-06 10:42:37,322 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:37,322 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:37,332 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-06 10:42:37,523 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,SelfDestructingSolverStorable12 [2025-02-06 10:42:37,523 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:37,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:37,523 INFO L85 PathProgramCache]: Analyzing trace with hash -210799390, now seen corresponding path program 1 times [2025-02-06 10:42:37,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:37,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507138715] [2025-02-06 10:42:37,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:37,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:37,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:42:37,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:42:37,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:37,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:37,939 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:37,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507138715] [2025-02-06 10:42:37,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507138715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:37,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107643703] [2025-02-06 10:42:37,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 10:42:37,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:37,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:37,942 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-06 10:42:37,947 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-06 10:42:38,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-06 10:42:38,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 10:42:38,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 10:42:38,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:38,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 45 conjuncts are in the unsatisfiable core [2025-02-06 10:42:38,082 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:38,086 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-06 10:42:38,104 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 10:42:38,104 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-06 10:42:38,117 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:38,117 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-06 10:42:38,130 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-06 10:42:38,130 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-06 10:42:38,150 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-02-06 10:42:38,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2025-02-06 10:42:38,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-02-06 10:42:38,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 10:42:38,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-02-06 10:42:38,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2025-02-06 10:42:38,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-02-06 10:42:38,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-06 10:42:38,258 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 10:42:38,276 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)))) is different from false [2025-02-06 10:42:38,281 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int))) (not (= |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|)))) is different from false [2025-02-06 10:42:38,287 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1213 (Array Int Int)) (v_ArrVal_1212 (Array Int Int))) (or (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base| v_ArrVal_1212) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| v_ArrVal_1213) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|)) (not (= v_ArrVal_1212 (let ((.cse0 (+ 4 |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.offset|))) (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_create_~new_head~0#1.base|) .cse0 (select v_ArrVal_1212 .cse0))))))) is different from false [2025-02-06 10:42:38,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2025-02-06 10:42:38,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 6 treesize of output 4 [2025-02-06 10:42:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 10 not checked. [2025-02-06 10:42:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [107643703] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 10:42:38,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 10:42:38,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 27 [2025-02-06 10:42:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231642521] [2025-02-06 10:42:38,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 10:42:38,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 10:42:38,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 10:42:38,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 10:42:38,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=486, Unknown=3, NotChecked=138, Total=702 [2025-02-06 10:42:38,430 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 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-06 10:42:38,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 10:42:38,675 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-02-06 10:42:38,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 10:42:38,676 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 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 44 [2025-02-06 10:42:38,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 10:42:38,676 INFO L225 Difference]: With dead ends: 87 [2025-02-06 10:42:38,676 INFO L226 Difference]: Without dead ends: 87 [2025-02-06 10:42:38,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 79 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=639, Unknown=3, NotChecked=162, Total=930 [2025-02-06 10:42:38,677 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 17 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 91 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 10:42:38,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 555 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 399 Invalid, 0 Unknown, 91 Unchecked, 0.2s Time] [2025-02-06 10:42:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-06 10:42:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-06 10:42:38,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 86 states have internal predecessors, (94), 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-06 10:42:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-02-06 10:42:38,679 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 44 [2025-02-06 10:42:38,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 10:42:38,679 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-02-06 10:42:38,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.074074074074074) internal successors, (83), 27 states have internal predecessors, (83), 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-06 10:42:38,679 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-02-06 10:42:38,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-02-06 10:42:38,680 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 10:42:38,680 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 10:42:38,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-06 10:42:38,880 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,SelfDestructingSolverStorable13 [2025-02-06 10:42:38,880 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 25 more)] === [2025-02-06 10:42:38,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 10:42:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash -658483512, now seen corresponding path program 2 times [2025-02-06 10:42:38,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 10:42:38,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90276965] [2025-02-06 10:42:38,881 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:42:38,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 10:42:38,898 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:42:38,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:42:38,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:42:38,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 10:42:39,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 10:42:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90276965] [2025-02-06 10:42:39,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90276965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 10:42:39,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858442520] [2025-02-06 10:42:39,759 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 10:42:39,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 10:42:39,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 10:42:39,761 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-06 10:42:39,762 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-06 10:42:39,845 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 10:42:39,884 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 10:42:39,884 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 10:42:39,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 10:42:39,886 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 75 conjuncts are in the unsatisfiable core [2025-02-06 10:42:39,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 10:42:39,918 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-06 10:42:39,977 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-06 10:42:39,977 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-06 10:42:40,008 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-06 10:42:40,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2025-02-06 10:42:40,090 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-06 10:42:40,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 29 [2025-02-06 10:42:40,145 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2025-02-06 10:42:40,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 36 [2025-02-06 10:42:40,155 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-06 10:42:40,191 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-06 10:42:40,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 30 [2025-02-06 10:42:40,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 10:42:40,287 INFO L349 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2025-02-06 10:42:40,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 53 [2025-02-06 10:42:40,300 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-02-06 10:42:40,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2025-02-06 10:42:40,825 INFO L349 Elim1Store]: treesize reduction 80, result has 1.2 percent of original size [2025-02-06 10:42:40,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 118 [2025-02-06 10:42:40,842 INFO L349 Elim1Store]: treesize reduction 96, result has 1.0 percent of original size [2025-02-06 10:42:40,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 147 treesize of output 139 [2025-02-06 10:42:41,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 10:42:41,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 139 treesize of output 199