./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 07:41:13,841 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 07:41:13,898 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-04 07:41:13,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 07:41:13,905 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 07:41:13,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 07:41:13,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 07:41:13,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 07:41:13,924 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 07:41:13,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 07:41:13,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 07:41:13,925 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 07:41:13,925 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 07:41:13,926 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 07:41:13,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:13,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 07:41:13,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 07:41:13,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 07:41:13,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 07:41:13,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f3d22aeda2fb15b9dd79854281ee0f5e475c0f7ee1551b76594f45703ddc81df [2025-03-04 07:41:14,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 07:41:14,154 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 07:41:14,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 07:41:14,157 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 07:41:14,158 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 07:41:14,159 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2025-03-04 07:41:15,318 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30805a34a/cc846e0cdc0f4823aefcb94b68adff95/FLAGed16bad1e [2025-03-04 07:41:15,544 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 07:41:15,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/ArraysOfVariableLength4.c [2025-03-04 07:41:15,551 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30805a34a/cc846e0cdc0f4823aefcb94b68adff95/FLAGed16bad1e [2025-03-04 07:41:15,579 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30805a34a/cc846e0cdc0f4823aefcb94b68adff95 [2025-03-04 07:41:15,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 07:41:15,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 07:41:15,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:15,593 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 07:41:15,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 07:41:15,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ea8090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15, skipping insertion in model container [2025-03-04 07:41:15,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,609 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 07:41:15,705 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:15,714 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 07:41:15,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 07:41:15,739 INFO L204 MainTranslator]: Completed translation [2025-03-04 07:41:15,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15 WrapperNode [2025-03-04 07:41:15,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 07:41:15,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:15,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 07:41:15,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 07:41:15,745 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,760 INFO L138 Inliner]: procedures = 8, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2025-03-04 07:41:15,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 07:41:15,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 07:41:15,761 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 07:41:15,761 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 07:41:15,766 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,766 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,767 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,775 INFO L175 MemorySlicer]: Split 3 memory accesses to 2 slices as follows [1, 2]. 67 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 1 writes are split as follows [0, 1]. [2025-03-04 07:41:15,775 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,775 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,779 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,781 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 07:41:15,781 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 07:41:15,781 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 07:41:15,782 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 07:41:15,782 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (1/1) ... [2025-03-04 07:41:15,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 07:41:15,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:15,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 07:41:15,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 07:41:15,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 07:41:15,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 07:41:15,880 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 07:41:15,881 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 07:41:16,028 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: call ULTIMATE.dealloc(main_~#b~0#1.base, main_~#b~0#1.offset);havoc main_~#b~0#1.base, main_~#b~0#1.offset;call ULTIMATE.dealloc(main_~#mask~0#1.base, main_~#mask~0#1.offset);havoc main_~#mask~0#1.base, main_~#mask~0#1.offset; [2025-03-04 07:41:16,037 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2025-03-04 07:41:16,037 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 07:41:16,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 07:41:16,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 07:41:16,047 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:16 BoogieIcfgContainer [2025-03-04 07:41:16,047 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 07:41:16,048 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 07:41:16,049 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 07:41:16,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 07:41:16,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 07:41:15" (1/3) ... [2025-03-04 07:41:16,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160c472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:16, skipping insertion in model container [2025-03-04 07:41:16,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 07:41:15" (2/3) ... [2025-03-04 07:41:16,055 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160c472 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 07:41:16, skipping insertion in model container [2025-03-04 07:41:16,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:16" (3/3) ... [2025-03-04 07:41:16,056 INFO L128 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength4.c [2025-03-04 07:41:16,068 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 07:41:16,070 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG ArraysOfVariableLength4.c that has 1 procedures, 25 locations, 1 initial locations, 3 loop locations, and 8 error locations. [2025-03-04 07:41:16,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 07:41:16,112 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;@44d26a5c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 07:41:16,113 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-04 07:41:16,115 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:41:16,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:41:16,119 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,123 INFO L85 PathProgramCache]: Analyzing trace with hash 59135101, now seen corresponding path program 1 times [2025-03-04 07:41:16,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683267997] [2025-03-04 07:41:16,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:41:16,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:41:16,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683267997] [2025-03-04 07:41:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683267997] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:16,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865208709] [2025-03-04 07:41:16,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:16,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:16,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,324 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.75) internal successors, (28), 24 states have internal predecessors, (28), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,360 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-03-04 07:41:16,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:41:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,365 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:41:16,365 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:41:16,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,368 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 41 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:16,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:41:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2025-03-04 07:41:16,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-03-04 07:41:16,389 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 5 [2025-03-04 07:41:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,389 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-03-04 07:41:16,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-03-04 07:41:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 07:41:16,389 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,389 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 07:41:16,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 07:41:16,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,391 INFO L85 PathProgramCache]: Analyzing trace with hash 59119884, now seen corresponding path program 1 times [2025-03-04 07:41:16,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265626344] [2025-03-04 07:41:16,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 07:41:16,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 07:41:16,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265626344] [2025-03-04 07:41:16,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265626344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593187612] [2025-03-04 07:41:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:16,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:16,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,459 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,488 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2025-03-04 07:41:16,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:16,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2025-03-04 07:41:16,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,490 INFO L225 Difference]: With dead ends: 46 [2025-03-04 07:41:16,490 INFO L226 Difference]: Without dead ends: 46 [2025-03-04 07:41:16,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,490 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 33 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:16,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2025-03-04 07:41:16,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 27. [2025-03-04 07:41:16,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.631578947368421) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2025-03-04 07:41:16,495 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 5 [2025-03-04 07:41:16,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,495 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2025-03-04 07:41:16,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,495 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2025-03-04 07:41:16,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:16,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,496 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:16,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 07:41:16,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1833181174, now seen corresponding path program 1 times [2025-03-04 07:41:16,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201741229] [2025-03-04 07:41:16,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:16,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:16,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201741229] [2025-03-04 07:41:16,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201741229] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:16,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:16,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:16,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051333905] [2025-03-04 07:41:16,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:16,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:16,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,565 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,579 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2025-03-04 07:41:16,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:16,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:16,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,580 INFO L225 Difference]: With dead ends: 30 [2025-03-04 07:41:16,580 INFO L226 Difference]: Without dead ends: 30 [2025-03-04 07:41:16,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:16,581 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 38 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:16,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-04 07:41:16,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-04 07:41:16,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 26 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-03-04 07:41:16,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-04 07:41:16,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2025-03-04 07:41:16,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,583 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-04 07:41:16,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-04 07:41:16,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:16,584 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,584 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:16,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 07:41:16,584 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1833188125, now seen corresponding path program 1 times [2025-03-04 07:41:16,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787270631] [2025-03-04 07:41:16,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:16,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:16,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787270631] [2025-03-04 07:41:16,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787270631] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:16,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:16,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:16,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042612156] [2025-03-04 07:41:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:16,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:16,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:16,656 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,699 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2025-03-04 07:41:16,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:16,700 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:16,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,700 INFO L225 Difference]: With dead ends: 26 [2025-03-04 07:41:16,700 INFO L226 Difference]: Without dead ends: 26 [2025-03-04 07:41:16,701 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:16,701 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 23 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:16,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-04 07:41:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-04 07:41:16,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-04 07:41:16,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 6 [2025-03-04 07:41:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-04 07:41:16,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-04 07:41:16,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-03-04 07:41:16,704 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 07:41:16,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 07:41:16,704 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1833188126, now seen corresponding path program 1 times [2025-03-04 07:41:16,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433092] [2025-03-04 07:41:16,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 07:41:16,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 07:41:16,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433092] [2025-03-04 07:41:16,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:16,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007647296] [2025-03-04 07:41:16,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:16,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:16,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:16,824 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:16,875 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2025-03-04 07:41:16,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:16,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-03-04 07:41:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:16,876 INFO L225 Difference]: With dead ends: 28 [2025-03-04 07:41:16,876 INFO L226 Difference]: Without dead ends: 28 [2025-03-04 07:41:16,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 07:41:16,876 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 25 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:16,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:16,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-04 07:41:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2025-03-04 07:41:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 26 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-03-04 07:41:16,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-04 07:41:16,879 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2025-03-04 07:41:16,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:16,879 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-04 07:41:16,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:16,880 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-04 07:41:16,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 07:41:16,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:16,880 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:16,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 07:41:16,880 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:16,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:16,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1998256474, now seen corresponding path program 1 times [2025-03-04 07:41:16,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:16,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-03-04 07:41:16,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:16,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:16,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:16,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039160934] [2025-03-04 07:41:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039160934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1143502094] [2025-03-04 07:41:16,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:16,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:16,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:16,947 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:16,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 07:41:16,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 07:41:16,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 07:41:16,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:16,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:16,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:16,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:17,008 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,008 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1143502094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:17,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:17,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 07:41:17,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648242387] [2025-03-04 07:41:17,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:17,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 07:41:17,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:17,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 07:41:17,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:17,048 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:17,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:17,108 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2025-03-04 07:41:17,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:17,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 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-03-04 07:41:17,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:17,110 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:41:17,112 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:41:17,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=30, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:17,113 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:17,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:41:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:41:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2025-03-04 07:41:17,115 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 9 [2025-03-04 07:41:17,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:17,116 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2025-03-04 07:41:17,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:17,116 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2025-03-04 07:41:17,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:17,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:17,116 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:17,122 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:17,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-04 07:41:17,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:17,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1816401593, now seen corresponding path program 1 times [2025-03-04 07:41:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:17,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679522919] [2025-03-04 07:41:17,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:17,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:17,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:17,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679522919] [2025-03-04 07:41:17,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679522919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189662162] [2025-03-04 07:41:17,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:17,387 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:17,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 07:41:17,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:17,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:17,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,424 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 07:41:17,425 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:17,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,464 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:17,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189662162] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:17,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:17,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2025-03-04 07:41:17,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558242418] [2025-03-04 07:41:17,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:17,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 07:41:17,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:17,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 07:41:17,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:17,495 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-03-04 07:41:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:17,522 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2025-03-04 07:41:17,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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 10 [2025-03-04 07:41:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:17,523 INFO L225 Difference]: With dead ends: 38 [2025-03-04 07:41:17,523 INFO L226 Difference]: Without dead ends: 38 [2025-03-04 07:41:17,523 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2025-03-04 07:41:17,523 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:17,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 35 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:17,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2025-03-04 07:41:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2025-03-04 07:41:17,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2025-03-04 07:41:17,528 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 10 [2025-03-04 07:41:17,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:17,529 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2025-03-04 07:41:17,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 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-03-04 07:41:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2025-03-04 07:41:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-04 07:41:17,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:17,529 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:17,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-03-04 07:41:17,732 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:17,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:17,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1816408545, now seen corresponding path program 1 times [2025-03-04 07:41:17,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:17,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21509188] [2025-03-04 07:41:17,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:17,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:17,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:17,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21509188] [2025-03-04 07:41:17,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21509188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:17,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319084256] [2025-03-04 07:41:17,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:17,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:17,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:17,840 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:17,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 07:41:17,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 07:41:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 07:41:17,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:17,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:17,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:41:17,874 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:17,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:17,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:17,962 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319084256] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:18,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 07:41:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693847966] [2025-03-04 07:41:18,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:18,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:41:18,032 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,135 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2025-03-04 07:41:18,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 07:41:18,135 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 10 [2025-03-04 07:41:18,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,135 INFO L225 Difference]: With dead ends: 39 [2025-03-04 07:41:18,135 INFO L226 Difference]: Without dead ends: 39 [2025-03-04 07:41:18,136 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:18,136 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 40 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2025-03-04 07:41:18,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2025-03-04 07:41:18,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.3125) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2025-03-04 07:41:18,138 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 10 [2025-03-04 07:41:18,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,138 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2025-03-04 07:41:18,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,138 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2025-03-04 07:41:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-04 07:41:18,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,138 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:18,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 07:41:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:18,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash 377987313, now seen corresponding path program 2 times [2025-03-04 07:41:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842207570] [2025-03-04 07:41:18,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:18,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 07:41:18,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:18,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:18,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,429 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842207570] [2025-03-04 07:41:18,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842207570] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:18,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [754521580] [2025-03-04 07:41:18,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:18,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:18,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:18,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:18,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 07:41:18,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-03-04 07:41:18,474 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 07:41:18,474 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:18,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:18,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-04 07:41:18,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:18,506 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [754521580] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:18,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2025-03-04 07:41:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667253810] [2025-03-04 07:41:18,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 07:41:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:18,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 07:41:18,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-03-04 07:41:18,606 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:18,813 INFO L93 Difference]: Finished difference Result 62 states and 76 transitions. [2025-03-04 07:41:18,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:18,814 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 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 21 [2025-03-04 07:41:18,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:18,815 INFO L225 Difference]: With dead ends: 62 [2025-03-04 07:41:18,815 INFO L226 Difference]: Without dead ends: 62 [2025-03-04 07:41:18,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=162, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:18,815 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:18,815 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 131 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:18,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2025-03-04 07:41:18,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2025-03-04 07:41:18,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 61 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 76 transitions. [2025-03-04 07:41:18,819 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 76 transitions. Word has length 21 [2025-03-04 07:41:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:18,820 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 76 transitions. [2025-03-04 07:41:18,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5833333333333335) internal successors, (43), 13 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 76 transitions. [2025-03-04 07:41:18,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:18,820 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:18,820 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:18,826 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 07:41:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,021 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:19,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1167302142, now seen corresponding path program 2 times [2025-03-04 07:41:19,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-03-04 07:41:19,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:19,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,031 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:19,035 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 22 statements. [2025-03-04 07:41:19,035 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:41:19,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-04 07:41:19,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676853367] [2025-03-04 07:41:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676853367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:19,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:19,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 07:41:19,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548860343] [2025-03-04 07:41:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 07:41:19,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 07:41:19,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:19,062 INFO L87 Difference]: Start difference. First operand 62 states and 76 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:19,073 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2025-03-04 07:41:19,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:19,074 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 22 [2025-03-04 07:41:19,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:19,074 INFO L225 Difference]: With dead ends: 60 [2025-03-04 07:41:19,074 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 07:41:19,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 07:41:19,075 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:19,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 16 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:19,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 07:41:19,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 07:41:19,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.3454545454545455) internal successors, (74), 59 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2025-03-04 07:41:19,077 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 22 [2025-03-04 07:41:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:19,077 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2025-03-04 07:41:19,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2025-03-04 07:41:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:19,077 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:19,078 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:19,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 07:41:19,078 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:19,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1167302141, now seen corresponding path program 1 times [2025-03-04 07:41:19,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830261414] [2025-03-04 07:41:19,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:41:19,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:19,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830261414] [2025-03-04 07:41:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830261414] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2085273593] [2025-03-04 07:41:19,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:19,141 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:19,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 07:41:19,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 07:41:19,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:19,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:19,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 07:41:19,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:19,349 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2085273593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:19,350 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:19,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-03-04 07:41:19,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958120973] [2025-03-04 07:41:19,350 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:19,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:19,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:19,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:19,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:19,353 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:19,416 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2025-03-04 07:41:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:19,417 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 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 22 [2025-03-04 07:41:19,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:19,417 INFO L225 Difference]: With dead ends: 60 [2025-03-04 07:41:19,417 INFO L226 Difference]: Without dead ends: 60 [2025-03-04 07:41:19,418 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=130, Invalid=142, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:19,419 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:19,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 87 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-04 07:41:19,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2025-03-04 07:41:19,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 59 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 68 transitions. [2025-03-04 07:41:19,424 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 68 transitions. Word has length 22 [2025-03-04 07:41:19,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:19,424 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 68 transitions. [2025-03-04 07:41:19,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 17 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:19,425 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2025-03-04 07:41:19,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 07:41:19,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:19,425 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2025-03-04 07:41:19,433 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:19,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 07:41:19,626 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:19,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:19,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1167295190, now seen corresponding path program 2 times [2025-03-04 07:41:19,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721666831] [2025-03-04 07:41:19,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:19,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:19,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:19,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:19,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721666831] [2025-03-04 07:41:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721666831] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235088508] [2025-03-04 07:41:19,849 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:19,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:19,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:19,851 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:19,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 07:41:19,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-04 07:41:19,903 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 07:41:19,903 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:19,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:19,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-04 07:41:19,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:19,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:20,060 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:20,220 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:20,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235088508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:20,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:20,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 19 [2025-03-04 07:41:20,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679348326] [2025-03-04 07:41:20,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:20,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-04 07:41:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:20,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-04 07:41:20,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-03-04 07:41:20,222 INFO L87 Difference]: Start difference. First operand 60 states and 68 transitions. Second operand has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 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-03-04 07:41:20,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:20,535 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2025-03-04 07:41:20,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 07:41:20,536 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 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) Word has length 22 [2025-03-04 07:41:20,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:20,536 INFO L225 Difference]: With dead ends: 59 [2025-03-04 07:41:20,536 INFO L226 Difference]: Without dead ends: 59 [2025-03-04 07:41:20,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=248, Invalid=682, Unknown=0, NotChecked=0, Total=930 [2025-03-04 07:41:20,537 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 114 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:20,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 81 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-04 07:41:20,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-04 07:41:20,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.1272727272727272) internal successors, (62), 58 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-03-04 07:41:20,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2025-03-04 07:41:20,542 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 22 [2025-03-04 07:41:20,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:20,542 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2025-03-04 07:41:20,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3157894736842106) internal successors, (63), 20 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-03-04 07:41:20,542 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2025-03-04 07:41:20,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 07:41:20,543 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:20,543 INFO L218 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-03-04 07:41:20,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:20,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:20,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:20,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:20,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1298157409, now seen corresponding path program 3 times [2025-03-04 07:41:20,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:20,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438015543] [2025-03-04 07:41:20,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:20,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:20,753 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-04 07:41:20,760 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 9 of 45 statements. [2025-03-04 07:41:20,760 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:20,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,823 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-04 07:41:20,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438015543] [2025-03-04 07:41:20,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438015543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:20,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283190466] [2025-03-04 07:41:20,823 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:20,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:20,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:20,827 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:20,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 07:41:20,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-03-04 07:41:20,870 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 9 of 45 statements. [2025-03-04 07:41:20,870 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:20,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:20,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:20,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:21,004 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-04 07:41:21,004 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:21,354 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2025-03-04 07:41:21,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283190466] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:21,354 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:21,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-03-04 07:41:21,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934251808] [2025-03-04 07:41:21,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 07:41:21,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 07:41:21,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2025-03-04 07:41:21,355 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,402 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-04 07:41:21,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:21,402 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 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 45 [2025-03-04 07:41:21,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,402 INFO L225 Difference]: With dead ends: 58 [2025-03-04 07:41:21,402 INFO L226 Difference]: Without dead ends: 58 [2025-03-04 07:41:21,403 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:41:21,403 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:21,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 75 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:21,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-04 07:41:21,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2025-03-04 07:41:21,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 56 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2025-03-04 07:41:21,405 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 45 [2025-03-04 07:41:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,405 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2025-03-04 07:41:21,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 15 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2025-03-04 07:41:21,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-03-04 07:41:21,410 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,410 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:21,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-04 07:41:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,611 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:21,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:21,611 INFO L85 PathProgramCache]: Analyzing trace with hash -1588180971, now seen corresponding path program 2 times [2025-03-04 07:41:21,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:21,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410883528] [2025-03-04 07:41:21,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:21,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:21,620 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-03-04 07:41:21,622 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 46 statements. [2025-03-04 07:41:21,622 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:41:21,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,666 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 07:41:21,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:21,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410883528] [2025-03-04 07:41:21,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410883528] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:21,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:21,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:21,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245131080] [2025-03-04 07:41:21,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:21,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:21,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:21,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:21,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:21,668 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:21,687 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2025-03-04 07:41:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 07:41:21,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 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 46 [2025-03-04 07:41:21,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:21,688 INFO L225 Difference]: With dead ends: 101 [2025-03-04 07:41:21,688 INFO L226 Difference]: Without dead ends: 101 [2025-03-04 07:41:21,688 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:21,688 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 9 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:21,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 25 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:21,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-03-04 07:41:21,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2025-03-04 07:41:21,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 97 states have (on average 1.0721649484536082) internal successors, (104), 99 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2025-03-04 07:41:21,694 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 46 [2025-03-04 07:41:21,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:21,694 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2025-03-04 07:41:21,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:21,694 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2025-03-04 07:41:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-04 07:41:21,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:21,695 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:21,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 07:41:21,696 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:21,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:21,697 INFO L85 PathProgramCache]: Analyzing trace with hash -33192303, now seen corresponding path program 1 times [2025-03-04 07:41:21,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:21,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419797802] [2025-03-04 07:41:21,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:21,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:41:21,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:41:21,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,793 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-03-04 07:41:21,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419797802] [2025-03-04 07:41:21,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419797802] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:21,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928192712] [2025-03-04 07:41:21,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:21,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:21,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:21,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:21,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 07:41:21,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 07:41:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 07:41:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:21,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-04 07:41:21,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:22,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:22,265 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 1 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:22,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928192712] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:22,266 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:22,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 13, 13] total 27 [2025-03-04 07:41:22,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168564434] [2025-03-04 07:41:22,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:22,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-04 07:41:22,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:22,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-04 07:41:22,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=418, Unknown=0, NotChecked=0, Total=702 [2025-03-04 07:41:22,268 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:23,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:23,194 INFO L93 Difference]: Finished difference Result 200 states and 205 transitions. [2025-03-04 07:41:23,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-03-04 07:41:23,195 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 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 50 [2025-03-04 07:41:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:23,195 INFO L225 Difference]: With dead ends: 200 [2025-03-04 07:41:23,195 INFO L226 Difference]: Without dead ends: 200 [2025-03-04 07:41:23,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1681, Invalid=3289, Unknown=0, NotChecked=0, Total=4970 [2025-03-04 07:41:23,198 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 299 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:23,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 37 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:23,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2025-03-04 07:41:23,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2025-03-04 07:41:23,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 194 states have (on average 1.0360824742268042) internal successors, (201), 196 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 201 transitions. [2025-03-04 07:41:23,208 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 201 transitions. Word has length 50 [2025-03-04 07:41:23,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:23,208 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 201 transitions. [2025-03-04 07:41:23,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 3.888888888888889) internal successors, (105), 27 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 201 transitions. [2025-03-04 07:41:23,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-04 07:41:23,209 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:23,209 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:23,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:23,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 07:41:23,410 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:23,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:23,411 INFO L85 PathProgramCache]: Analyzing trace with hash -654254257, now seen corresponding path program 1 times [2025-03-04 07:41:23,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245050501] [2025-03-04 07:41:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:23,425 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 07:41:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 07:41:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 1 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:23,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245050501] [2025-03-04 07:41:23,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245050501] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:23,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575657096] [2025-03-04 07:41:23,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:23,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:23,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:23,979 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:23,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 07:41:24,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-04 07:41:24,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-04 07:41:24,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:24,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:24,071 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-04 07:41:24,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:24,535 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 1 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:24,972 INFO L134 CoverageAnalysis]: Checked inductivity of 947 backedges. 1 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 07:41:24,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575657096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:24,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:24,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 57 [2025-03-04 07:41:24,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906676127] [2025-03-04 07:41:24,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:24,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2025-03-04 07:41:24,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:24,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2025-03-04 07:41:24,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1365, Invalid=1827, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:41:24,977 INFO L87 Difference]: Start difference. First operand 197 states and 201 transitions. Second operand has 57 states, 57 states have (on average 4.017543859649122) internal successors, (229), 57 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:25,115 INFO L93 Difference]: Finished difference Result 277 states and 281 transitions. [2025-03-04 07:41:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 07:41:25,116 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 4.017543859649122) internal successors, (229), 57 states have internal predecessors, (229), 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 101 [2025-03-04 07:41:25,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:25,116 INFO L225 Difference]: With dead ends: 277 [2025-03-04 07:41:25,117 INFO L226 Difference]: Without dead ends: 277 [2025-03-04 07:41:25,117 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 156 SyntacticMatches, 14 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1365, Invalid=1827, Unknown=0, NotChecked=0, Total=3192 [2025-03-04 07:41:25,118 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:25,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:25,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2025-03-04 07:41:25,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2025-03-04 07:41:25,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 274 states have (on average 1.0255474452554745) internal successors, (281), 276 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 281 transitions. [2025-03-04 07:41:25,128 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 281 transitions. Word has length 101 [2025-03-04 07:41:25,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:25,129 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 281 transitions. [2025-03-04 07:41:25,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 4.017543859649122) internal successors, (229), 57 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,129 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 281 transitions. [2025-03-04 07:41:25,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 07:41:25,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:25,129 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:25,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 07:41:25,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-04 07:41:25,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:25,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash -920706191, now seen corresponding path program 2 times [2025-03-04 07:41:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734460166] [2025-03-04 07:41:25,331 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:25,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,343 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 141 statements into 2 equivalence classes. [2025-03-04 07:41:25,348 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 8 of 141 statements. [2025-03-04 07:41:25,349 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 07:41:25,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2017 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2017 trivial. 0 not checked. [2025-03-04 07:41:25,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734460166] [2025-03-04 07:41:25,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734460166] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:25,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:25,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 07:41:25,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999283056] [2025-03-04 07:41:25,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:25,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 07:41:25,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:25,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 07:41:25,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:25,408 INFO L87 Difference]: Start difference. First operand 277 states and 281 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:25,423 INFO L93 Difference]: Finished difference Result 276 states and 280 transitions. [2025-03-04 07:41:25,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 07:41:25,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 141 [2025-03-04 07:41:25,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:25,424 INFO L225 Difference]: With dead ends: 276 [2025-03-04 07:41:25,424 INFO L226 Difference]: Without dead ends: 274 [2025-03-04 07:41:25,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 07:41:25,425 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 1 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 22 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-03-04 07:41:25,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 22 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:25,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2025-03-04 07:41:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2025-03-04 07:41:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 272 states have (on average 1.0183823529411764) internal successors, (277), 273 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 277 transitions. [2025-03-04 07:41:25,431 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 277 transitions. Word has length 141 [2025-03-04 07:41:25,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:25,431 INFO L471 AbstractCegarLoop]: Abstraction has 274 states and 277 transitions. [2025-03-04 07:41:25,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 277 transitions. [2025-03-04 07:41:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-04 07:41:25,432 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:25,432 INFO L218 NwaCegarLoop]: trace histogram [32, 32, 32, 32, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:25,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 07:41:25,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:25,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:25,433 INFO L85 PathProgramCache]: Analyzing trace with hash -920704040, now seen corresponding path program 1 times [2025-03-04 07:41:25,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:25,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47357114] [2025-03-04 07:41:25,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:25,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:41:25,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:41:25,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,581 INFO L134 CoverageAnalysis]: Checked inductivity of 2019 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2018 trivial. 0 not checked. [2025-03-04 07:41:25,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47357114] [2025-03-04 07:41:25,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47357114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:25,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711637284] [2025-03-04 07:41:25,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:25,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:25,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:25,583 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:25,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 07:41:25,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-04 07:41:25,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-04 07:41:25,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:25,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:25,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 07:41:25,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 2019 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2025-03-04 07:41:25,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:26,060 INFO L134 CoverageAnalysis]: Checked inductivity of 2019 backedges. 184 proven. 3 refuted. 0 times theorem prover too weak. 1832 trivial. 0 not checked. [2025-03-04 07:41:26,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711637284] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:26,060 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:26,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 11 [2025-03-04 07:41:26,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331186220] [2025-03-04 07:41:26,061 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:26,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 07:41:26,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:26,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 07:41:26,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:41:26,062 INFO L87 Difference]: Start difference. First operand 274 states and 277 transitions. Second operand has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:26,156 INFO L93 Difference]: Finished difference Result 550 states and 559 transitions. [2025-03-04 07:41:26,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 07:41:26,156 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 141 [2025-03-04 07:41:26,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:26,158 INFO L225 Difference]: With dead ends: 550 [2025-03-04 07:41:26,158 INFO L226 Difference]: Without dead ends: 550 [2025-03-04 07:41:26,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 275 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2025-03-04 07:41:26,159 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:26,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 31 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:26,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2025-03-04 07:41:26,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 542. [2025-03-04 07:41:26,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 540 states have (on average 1.0166666666666666) internal successors, (549), 541 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 549 transitions. [2025-03-04 07:41:26,167 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 549 transitions. Word has length 141 [2025-03-04 07:41:26,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:26,167 INFO L471 AbstractCegarLoop]: Abstraction has 542 states and 549 transitions. [2025-03-04 07:41:26,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:26,168 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 549 transitions. [2025-03-04 07:41:26,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2025-03-04 07:41:26,170 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:26,170 INFO L218 NwaCegarLoop]: trace histogram [64, 64, 64, 64, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 07:41:26,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:26,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 07:41:26,371 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1450930830, now seen corresponding path program 1 times [2025-03-04 07:41:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561086863] [2025-03-04 07:41:26,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:26,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-04 07:41:26,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-04 07:41:26,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:26,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:26,907 INFO L134 CoverageAnalysis]: Checked inductivity of 8196 backedges. 0 proven. 4164 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2025-03-04 07:41:26,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561086863] [2025-03-04 07:41:26,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561086863] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:26,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863412068] [2025-03-04 07:41:26,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 07:41:26,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:26,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:26,909 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:26,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 07:41:26,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-04 07:41:27,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-04 07:41:27,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 07:41:27,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:27,075 INFO L256 TraceCheckSpWp]: Trace formula consists of 917 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-04 07:41:27,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:27,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:41:27,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-04 07:41:27,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2025-03-04 07:41:28,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8196 backedges. 0 proven. 4164 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2025-03-04 07:41:28,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:28,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8196 backedges. 0 proven. 4164 refuted. 0 times theorem prover too weak. 4032 trivial. 0 not checked. [2025-03-04 07:41:28,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863412068] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:28,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:28,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 3] total 9 [2025-03-04 07:41:28,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215082284] [2025-03-04 07:41:28,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:28,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 07:41:28,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:28,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 07:41:28,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-04 07:41:28,775 INFO L87 Difference]: Start difference. First operand 542 states and 549 transitions. Second operand has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:28,818 INFO L93 Difference]: Finished difference Result 673 states and 679 transitions. [2025-03-04 07:41:28,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:28,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 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 267 [2025-03-04 07:41:28,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:28,820 INFO L225 Difference]: With dead ends: 673 [2025-03-04 07:41:28,820 INFO L226 Difference]: Without dead ends: 673 [2025-03-04 07:41:28,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 537 GetRequests, 528 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-04 07:41:28,821 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 12 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:28,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:28,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-04 07:41:28,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-04 07:41:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 671 states have (on average 1.0119225037257824) internal successors, (679), 672 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 679 transitions. [2025-03-04 07:41:28,833 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 679 transitions. Word has length 267 [2025-03-04 07:41:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:28,834 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 679 transitions. [2025-03-04 07:41:28,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.111111111111111) internal successors, (55), 10 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:28,838 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 679 transitions. [2025-03-04 07:41:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-04 07:41:28,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:28,842 INFO L218 NwaCegarLoop]: trace histogram [128, 128, 128, 128, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:28,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 07:41:29,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:29,042 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:29,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:29,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1554031421, now seen corresponding path program 2 times [2025-03-04 07:41:29,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:29,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125425616] [2025-03-04 07:41:29,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:29,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:29,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 540 statements into 2 equivalence classes. [2025-03-04 07:41:29,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 07:41:29,146 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:29,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,686 INFO L134 CoverageAnalysis]: Checked inductivity of 33060 backedges. 0 proven. 24994 refuted. 0 times theorem prover too weak. 8066 trivial. 0 not checked. [2025-03-04 07:41:29,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:29,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125425616] [2025-03-04 07:41:29,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125425616] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:29,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250353096] [2025-03-04 07:41:29,690 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:29,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:29,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:29,692 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:29,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 07:41:29,797 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 540 statements into 2 equivalence classes. [2025-03-04 07:41:29,964 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 540 of 540 statements. [2025-03-04 07:41:29,965 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:29,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:29,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 07:41:29,979 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:30,928 INFO L134 CoverageAnalysis]: Checked inductivity of 33060 backedges. 4164 proven. 16663 refuted. 0 times theorem prover too weak. 12233 trivial. 0 not checked. [2025-03-04 07:41:30,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:31,505 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 24 treesize of output 20 [2025-03-04 07:41:31,951 INFO L134 CoverageAnalysis]: Checked inductivity of 33060 backedges. 4164 proven. 16663 refuted. 0 times theorem prover too weak. 12233 trivial. 0 not checked. [2025-03-04 07:41:31,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250353096] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:31,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:31,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 17 [2025-03-04 07:41:31,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762833745] [2025-03-04 07:41:31,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:31,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-04 07:41:31,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:31,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-04 07:41:31,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2025-03-04 07:41:31,953 INFO L87 Difference]: Start difference. First operand 673 states and 679 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:32,142 INFO L93 Difference]: Finished difference Result 820 states and 831 transitions. [2025-03-04 07:41:32,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:32,143 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 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 540 [2025-03-04 07:41:32,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:32,145 INFO L225 Difference]: With dead ends: 820 [2025-03-04 07:41:32,145 INFO L226 Difference]: Without dead ends: 820 [2025-03-04 07:41:32,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1093 GetRequests, 1070 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=441, Unknown=0, NotChecked=0, Total=600 [2025-03-04 07:41:32,146 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 86 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:32,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 141 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:32,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2025-03-04 07:41:32,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 678. [2025-03-04 07:41:32,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 676 states have (on average 1.0118343195266273) internal successors, (684), 677 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 684 transitions. [2025-03-04 07:41:32,154 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 684 transitions. Word has length 540 [2025-03-04 07:41:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:32,155 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 684 transitions. [2025-03-04 07:41:32,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 684 transitions. [2025-03-04 07:41:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2025-03-04 07:41:32,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:32,162 INFO L218 NwaCegarLoop]: trace histogram [160, 160, 160, 160, 5, 5, 5, 4, 4, 1, 1, 1] [2025-03-04 07:41:32,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 07:41:32,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:32,367 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:32,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -2035856873, now seen corresponding path program 2 times [2025-03-04 07:41:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:32,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720392720] [2025-03-04 07:41:32,368 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:32,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:32,418 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 666 statements into 2 equivalence classes. [2025-03-04 07:41:32,532 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 666 of 666 statements. [2025-03-04 07:41:32,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:32,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:33,763 INFO L134 CoverageAnalysis]: Checked inductivity of 51726 backedges. 0 proven. 41646 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2025-03-04 07:41:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720392720] [2025-03-04 07:41:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720392720] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 07:41:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968782992] [2025-03-04 07:41:33,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 07:41:33,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 07:41:33,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 07:41:33,765 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 07:41:33,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 07:41:33,906 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 666 statements into 2 equivalence classes. [2025-03-04 07:41:34,117 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 666 of 666 statements. [2025-03-04 07:41:34,117 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 07:41:34,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:34,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 2261 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-04 07:41:34,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 07:41:34,145 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 10 treesize of output 8 [2025-03-04 07:41:34,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-04 07:41:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 51726 backedges. 0 proven. 41646 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2025-03-04 07:41:36,247 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 07:41:37,656 INFO L134 CoverageAnalysis]: Checked inductivity of 51726 backedges. 0 proven. 41646 refuted. 0 times theorem prover too weak. 10080 trivial. 0 not checked. [2025-03-04 07:41:37,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968782992] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 07:41:37,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 07:41:37,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 6] total 17 [2025-03-04 07:41:37,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581942479] [2025-03-04 07:41:37,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 07:41:37,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 07:41:37,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:37,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 07:41:37,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-04 07:41:37,659 INFO L87 Difference]: Start difference. First operand 678 states and 684 transitions. Second operand has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:37,862 INFO L93 Difference]: Finished difference Result 1474 states and 1491 transitions. [2025-03-04 07:41:37,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 07:41:37,864 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 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 666 [2025-03-04 07:41:37,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:37,868 INFO L225 Difference]: With dead ends: 1474 [2025-03-04 07:41:37,868 INFO L226 Difference]: Without dead ends: 1474 [2025-03-04 07:41:37,868 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1342 GetRequests, 1320 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=192, Invalid=360, Unknown=0, NotChecked=0, Total=552 [2025-03-04 07:41:37,869 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 15 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:37,869 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 243 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 07:41:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2025-03-04 07:41:37,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1474. [2025-03-04 07:41:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1474 states, 1472 states have (on average 1.012907608695652) internal successors, (1491), 1473 states have internal predecessors, (1491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1474 states to 1474 states and 1491 transitions. [2025-03-04 07:41:37,885 INFO L78 Accepts]: Start accepts. Automaton has 1474 states and 1491 transitions. Word has length 666 [2025-03-04 07:41:37,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:37,886 INFO L471 AbstractCegarLoop]: Abstraction has 1474 states and 1491 transitions. [2025-03-04 07:41:37,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 8.0) internal successors, (136), 18 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:37,886 INFO L276 IsEmpty]: Start isEmpty. Operand 1474 states and 1491 transitions. [2025-03-04 07:41:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2025-03-04 07:41:37,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 07:41:37,889 INFO L218 NwaCegarLoop]: trace histogram [160, 160, 160, 160, 5, 5, 5, 5, 5, 3, 2, 2, 1, 1, 1, 1] [2025-03-04 07:41:37,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 07:41:38,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-03-04 07:41:38,090 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 5 more)] === [2025-03-04 07:41:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 07:41:38,090 INFO L85 PathProgramCache]: Analyzing trace with hash -285282957, now seen corresponding path program 3 times [2025-03-04 07:41:38,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 07:41:38,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-04 07:41:38,090 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 07:41:38,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 07:41:38,126 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 676 statements into 164 equivalence classes. [2025-03-04 07:41:38,131 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 676 statements. [2025-03-04 07:41:38,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 07:41:38,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 07:41:38,206 INFO L134 CoverageAnalysis]: Checked inductivity of 51742 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 51737 trivial. 0 not checked. [2025-03-04 07:41:38,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 07:41:38,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057611210] [2025-03-04 07:41:38,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057611210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 07:41:38,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 07:41:38,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 07:41:38,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023473785] [2025-03-04 07:41:38,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 07:41:38,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 07:41:38,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 07:41:38,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 07:41:38,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-04 07:41:38,208 INFO L87 Difference]: Start difference. First operand 1474 states and 1491 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:38,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 07:41:38,247 INFO L93 Difference]: Finished difference Result 1472 states and 1489 transitions. [2025-03-04 07:41:38,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 07:41:38,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 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 676 [2025-03-04 07:41:38,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 07:41:38,250 INFO L225 Difference]: With dead ends: 1472 [2025-03-04 07:41:38,250 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 07:41:38,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2025-03-04 07:41:38,251 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 07:41:38,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 25 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 07:41:38,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 07:41:38,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 07:41:38,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:38,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 07:41:38,252 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 676 [2025-03-04 07:41:38,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 07:41:38,252 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 07:41:38,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 07:41:38,254 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 07:41:38,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (7 of 8 remaining) [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 8 remaining) [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 8 remaining) [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 8 remaining) [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 8 remaining) [2025-03-04 07:41:38,256 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 8 remaining) [2025-03-04 07:41:38,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 8 remaining) [2025-03-04 07:41:38,257 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONARRAY_INDEX (0 of 8 remaining) [2025-03-04 07:41:38,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 07:41:38,259 INFO L422 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 07:41:38,261 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 07:41:38,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 07:41:38 BoogieIcfgContainer [2025-03-04 07:41:38,263 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 07:41:38,264 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 07:41:38,264 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 07:41:38,264 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 07:41:38,265 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 07:41:16" (3/4) ... [2025-03-04 07:41:38,266 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 07:41:38,273 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-03-04 07:41:38,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 07:41:38,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 07:41:38,274 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 07:41:38,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 07:41:38,338 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 07:41:38,338 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 07:41:38,340 INFO L158 Benchmark]: Toolchain (without parser) took 22755.64ms. Allocated memory was 142.6MB in the beginning and 637.5MB in the end (delta: 494.9MB). Free memory was 107.0MB in the beginning and 598.9MB in the end (delta: -492.0MB). Peak memory consumption was 304.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:38,340 INFO L158 Benchmark]: CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:38,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.21ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:38,340 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.17ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:38,340 INFO L158 Benchmark]: Boogie Preprocessor took 19.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 07:41:38,340 INFO L158 Benchmark]: IcfgBuilder took 265.35ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 81.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 07:41:38,341 INFO L158 Benchmark]: TraceAbstraction took 22214.99ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 80.0MB in the beginning and 196.2MB in the end (delta: -116.1MB). Peak memory consumption was 271.3MB. Max. memory is 16.1GB. [2025-03-04 07:41:38,341 INFO L158 Benchmark]: Witness Printer took 74.33ms. Allocated memory was 528.5MB in the beginning and 637.5MB in the end (delta: 109.1MB). Free memory was 196.2MB in the beginning and 598.9MB in the end (delta: -402.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 07:41:38,342 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62ms. Allocated memory is still 201.3MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.21ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 96.8MB in the end (delta: 10.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.17ms. Allocated memory is still 142.6MB. Free memory was 96.8MB in the beginning and 95.6MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.90ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 94.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 265.35ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 81.2MB in the end (delta: 13.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 22214.99ms. Allocated memory was 142.6MB in the beginning and 528.5MB in the end (delta: 385.9MB). Free memory was 80.0MB in the beginning and 196.2MB in the end (delta: -116.1MB). Peak memory consumption was 271.3MB. Max. memory is 16.1GB. * Witness Printer took 74.33ms. Allocated memory was 528.5MB in the beginning and 637.5MB in the end (delta: 109.1MB). Free memory was 196.2MB in the beginning and 598.9MB in the end (delta: -402.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 25 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 22.2s, OverallIterations: 22, TraceHistogramMax: 160, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 805 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 805 mSDsluCounter, 1317 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 954 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1833 IncrementalHoareTripleChecker+Invalid, 1915 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 363 mSDtfsCounter, 1833 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3985 GetRequests, 3663 SyntacticMatches, 15 SemanticMatches, 307 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3650 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1474occurred in iteration=21, InterpolantAutomatonStates: 216, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 181 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 14.4s InterpolantComputationTime, 4721 NumberOfCodeBlocks, 3797 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 6577 ConstructedInterpolants, 0 QuantifiedInterpolants, 69354 SizeOfPredicates, 23 NumberOfNonLiveVariables, 6625 ConjunctsInSsa, 181 ConjunctsInUnsatCore, 48 InterpolantComputations, 9 PerfectInterpolantSequences, 143759/343300 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 07:41:38,359 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE